./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --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-38b53e6 [2022-11-26 00:31:46,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:31:46,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:31:46,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:31:46,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:31:46,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:31:46,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:31:46,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:31:46,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:31:46,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:31:46,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:31:46,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:31:46,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:31:46,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:31:46,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:31:46,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:31:46,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:31:46,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:31:46,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:31:46,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:31:46,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:31:46,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:31:46,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:31:46,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:31:46,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:31:46,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:31:46,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:31:46,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:31:46,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:31:46,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:31:46,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:31:46,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:31:46,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:31:46,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:31:46,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:31:46,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:31:46,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:31:46,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:31:46,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:31:46,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:31:46,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:31:46,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:31:46,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:31:46,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:31:46,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:31:46,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:31:46,281 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:31:46,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:31:46,282 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:31:46,282 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:31:46,282 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:31:46,282 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:31:46,283 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:31:46,283 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:31:46,284 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:31:46,284 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:31:46,284 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:31:46,284 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:31:46,285 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:31:46,285 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:31:46,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:31:46,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:31:46,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:31:46,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:31:46,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:31:46,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:31:46,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:31:46,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:31:46,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:31:46,288 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:31:46,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:31:46,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:31:46,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:31:46,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:31:46,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:31:46,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:31:46,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:31:46,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:31:46,291 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:31:46,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:31:46,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:31:46,292 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:31:46,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:31:46,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:31:46,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:31:46,293 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_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/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_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-26 00:31:46,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:31:46,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:31:46,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:31:46,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:31:46,635 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:31:46,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-26 00:31:49,786 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:31:50,019 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:31:50,020 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-26 00:31:50,028 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/data/dbc0ed7ec/cc2fb236ffd8482dbb63a816041c7913/FLAGfd6350270 [2022-11-26 00:31:50,052 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/data/dbc0ed7ec/cc2fb236ffd8482dbb63a816041c7913 [2022-11-26 00:31:50,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:31:50,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:31:50,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:31:50,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:31:50,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:31:50,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c10258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50, skipping insertion in model container [2022-11-26 00:31:50,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:31:50,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:31:50,307 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_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-26 00:31:50,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:31:50,329 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:31:50,354 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_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-26 00:31:50,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:31:50,376 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:31:50,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50 WrapperNode [2022-11-26 00:31:50,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:31:50,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:31:50,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:31:50,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:31:50,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,442 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 395 [2022-11-26 00:31:50,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:31:50,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:31:50,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:31:50,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:31:50,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:31:50,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:31:50,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:31:50,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:31:50,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (1/1) ... [2022-11-26 00:31:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:31:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:31:50,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:31:50,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:31:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:31:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-26 00:31:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-26 00:31:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-26 00:31:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:31:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:31:50,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:31:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:31:50,573 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:31:50,808 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:31:50,810 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:31:51,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:31:51,761 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:31:51,765 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-26 00:31:51,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:31:51 BoogieIcfgContainer [2022-11-26 00:31:51,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:31:51,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:31:51,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:31:51,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:31:51,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:31:50" (1/3) ... [2022-11-26 00:31:51,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccbcbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:31:51, skipping insertion in model container [2022-11-26 00:31:51,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:31:50" (2/3) ... [2022-11-26 00:31:51,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccbcbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:31:51, skipping insertion in model container [2022-11-26 00:31:51,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:31:51" (3/3) ... [2022-11-26 00:31:51,793 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-26 00:31:51,806 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:31:51,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:31:51,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-11-26 00:31:51,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:31:52,022 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-26 00:31:52,108 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:31:52,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 546 places, 583 transitions, 1182 flow [2022-11-26 00:31:52,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 546 places, 583 transitions, 1182 flow [2022-11-26 00:31:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 583 transitions, 1182 flow [2022-11-26 00:31:52,437 INFO L130 PetriNetUnfolder]: 44/581 cut-off events. [2022-11-26 00:31:52,438 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-26 00:31:52,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 581 events. 44/581 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1853 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 455. Up to 2 conditions per place. [2022-11-26 00:31:52,518 INFO L119 LiptonReduction]: Number of co-enabled transitions 105228 [2022-11-26 00:32:51,722 INFO L134 LiptonReduction]: Checked pairs total: 104764 [2022-11-26 00:32:51,722 INFO L136 LiptonReduction]: Total number of compositions: 844 [2022-11-26 00:32:51,731 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 75 transitions, 166 flow [2022-11-26 00:32:51,837 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:51,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:32:51,867 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;@5113f31b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:32:51,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2022-11-26 00:32:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 00:32:51,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:51,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 00:32:51,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 83853, now seen corresponding path program 1 times [2022-11-26 00:32:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:51,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501060487] [2022-11-26 00:32:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:52,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:52,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501060487] [2022-11-26 00:32:52,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501060487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:52,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213719760] [2022-11-26 00:32:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:52,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:52,395 INFO L87 Difference]: Start difference. First operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:52,600 INFO L93 Difference]: Finished difference Result 734 states and 1826 transitions. [2022-11-26 00:32:52,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-26 00:32:52,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:52,638 INFO L225 Difference]: With dead ends: 734 [2022-11-26 00:32:52,640 INFO L226 Difference]: Without dead ends: 734 [2022-11-26 00:32:52,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:52,647 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:52,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-11-26 00:32:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2022-11-26 00:32:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 482 states have (on average 3.788381742738589) internal successors, (1826), 733 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1826 transitions. [2022-11-26 00:32:52,765 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1826 transitions. Word has length 2 [2022-11-26 00:32:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:52,766 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1826 transitions. [2022-11-26 00:32:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1826 transitions. [2022-11-26 00:32:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 00:32:52,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:52,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 00:32:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:32:52,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 83921, now seen corresponding path program 1 times [2022-11-26 00:32:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:52,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345948601] [2022-11-26 00:32:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:52,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:52,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345948601] [2022-11-26 00:32:52,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345948601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:52,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:52,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709494848] [2022-11-26 00:32:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:52,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:52,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:52,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:52,912 INFO L87 Difference]: Start difference. First operand 734 states and 1826 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:53,169 INFO L93 Difference]: Finished difference Result 1466 states and 3650 transitions. [2022-11-26 00:32:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:53,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-26 00:32:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:53,179 INFO L225 Difference]: With dead ends: 1466 [2022-11-26 00:32:53,179 INFO L226 Difference]: Without dead ends: 1466 [2022-11-26 00:32:53,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:53,181 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:53,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:32:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-11-26 00:32:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 735. [2022-11-26 00:32:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 483 states have (on average 3.7846790890269153) internal successors, (1828), 734 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1828 transitions. [2022-11-26 00:32:53,224 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1828 transitions. Word has length 2 [2022-11-26 00:32:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:53,225 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 1828 transitions. [2022-11-26 00:32:53,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1828 transitions. [2022-11-26 00:32:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:32:53,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:53,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:32:53,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:32:53,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:53,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2607693, now seen corresponding path program 1 times [2022-11-26 00:32:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:53,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427555140] [2022-11-26 00:32:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:53,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:53,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427555140] [2022-11-26 00:32:53,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427555140] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608978240] [2022-11-26 00:32:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:53,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:53,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:53,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:32:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:53,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:32:53,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:53,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:53,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608978240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:32:53,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793559815] [2022-11-26 00:32:53,609 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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-11-26 00:32:53,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:53,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2022-11-26 00:32:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977452033] [2022-11-26 00:32:53,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:53,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:32:53,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:53,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:32:53,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:32:53,627 INFO L87 Difference]: Start difference. First operand 735 states and 1828 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:54,252 INFO L93 Difference]: Finished difference Result 3662 states and 9122 transitions. [2022-11-26 00:32:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:32:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:32:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:54,280 INFO L225 Difference]: With dead ends: 3662 [2022-11-26 00:32:54,280 INFO L226 Difference]: Without dead ends: 3662 [2022-11-26 00:32:54,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:32:54,282 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 270 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:54,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 5 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:32:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2022-11-26 00:32:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 738. [2022-11-26 00:32:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 486 states have (on average 3.7736625514403292) internal successors, (1834), 737 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1834 transitions. [2022-11-26 00:32:54,386 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1834 transitions. Word has length 3 [2022-11-26 00:32:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:54,386 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1834 transitions. [2022-11-26 00:32:54,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1834 transitions. [2022-11-26 00:32:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:32:54,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:54,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:32:54,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:32:54,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:54,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:54,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 80833144, now seen corresponding path program 1 times [2022-11-26 00:32:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:54,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062877149] [2022-11-26 00:32:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:54,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:54,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:54,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062877149] [2022-11-26 00:32:54,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062877149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:54,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:54,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:32:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453683335] [2022-11-26 00:32:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:54,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:32:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:54,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:32:54,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:32:54,885 INFO L87 Difference]: Start difference. First operand 738 states and 1834 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:55,222 INFO L93 Difference]: Finished difference Result 957 states and 2328 transitions. [2022-11-26 00:32:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:32:55,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 00:32:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:55,231 INFO L225 Difference]: With dead ends: 957 [2022-11-26 00:32:55,232 INFO L226 Difference]: Without dead ends: 957 [2022-11-26 00:32:55,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:32:55,237 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 72 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:55,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 3 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:32:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-11-26 00:32:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 771. [2022-11-26 00:32:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 519 states have (on average 3.930635838150289) internal successors, (2040), 770 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2040 transitions. [2022-11-26 00:32:55,297 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2040 transitions. Word has length 4 [2022-11-26 00:32:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:55,298 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 2040 transitions. [2022-11-26 00:32:55,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2040 transitions. [2022-11-26 00:32:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:32:55,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:55,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:32:55,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:32:55,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 80833216, now seen corresponding path program 1 times [2022-11-26 00:32:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363888111] [2022-11-26 00:32:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:55,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:55,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363888111] [2022-11-26 00:32:55,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363888111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:55,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:55,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191896158] [2022-11-26 00:32:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:55,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:55,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:55,431 INFO L87 Difference]: Start difference. First operand 771 states and 2040 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:55,552 INFO L93 Difference]: Finished difference Result 707 states and 1850 transitions. [2022-11-26 00:32:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:55,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 00:32:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:55,557 INFO L225 Difference]: With dead ends: 707 [2022-11-26 00:32:55,557 INFO L226 Difference]: Without dead ends: 707 [2022-11-26 00:32:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:55,558 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:55,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-26 00:32:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2022-11-26 00:32:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 483 states have (on average 3.8302277432712217) internal successors, (1850), 706 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1850 transitions. [2022-11-26 00:32:55,582 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1850 transitions. Word has length 4 [2022-11-26 00:32:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:55,582 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 1850 transitions. [2022-11-26 00:32:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1850 transitions. [2022-11-26 00:32:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:32:55,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:55,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:32:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:32:55,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 80833214, now seen corresponding path program 1 times [2022-11-26 00:32:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:55,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135558863] [2022-11-26 00:32:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:55,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:55,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135558863] [2022-11-26 00:32:55,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135558863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:55,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:55,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258149064] [2022-11-26 00:32:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:55,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:55,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:55,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:55,670 INFO L87 Difference]: Start difference. First operand 707 states and 1850 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:55,791 INFO L93 Difference]: Finished difference Result 643 states and 1660 transitions. [2022-11-26 00:32:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 00:32:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:55,797 INFO L225 Difference]: With dead ends: 643 [2022-11-26 00:32:55,797 INFO L226 Difference]: Without dead ends: 643 [2022-11-26 00:32:55,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:55,798 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:55,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:32:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-26 00:32:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2022-11-26 00:32:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 447 states have (on average 3.713646532438479) internal successors, (1660), 642 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1660 transitions. [2022-11-26 00:32:55,822 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1660 transitions. Word has length 4 [2022-11-26 00:32:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:55,823 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 1660 transitions. [2022-11-26 00:32:55,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1660 transitions. [2022-11-26 00:32:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:32:55,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:55,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:32:55,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:32:55,825 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 80833055, now seen corresponding path program 1 times [2022-11-26 00:32:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:55,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300544179] [2022-11-26 00:32:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:55,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:55,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300544179] [2022-11-26 00:32:55,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300544179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:55,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:55,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405581144] [2022-11-26 00:32:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:55,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:55,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:55,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:55,882 INFO L87 Difference]: Start difference. First operand 643 states and 1660 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:56,077 INFO L93 Difference]: Finished difference Result 1021 states and 2708 transitions. [2022-11-26 00:32:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 00:32:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:56,084 INFO L225 Difference]: With dead ends: 1021 [2022-11-26 00:32:56,085 INFO L226 Difference]: Without dead ends: 1021 [2022-11-26 00:32:56,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:56,086 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:56,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:32:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-26 00:32:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 739. [2022-11-26 00:32:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 543 states have (on average 4.138121546961326) internal successors, (2247), 738 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2247 transitions. [2022-11-26 00:32:56,113 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 2247 transitions. Word has length 4 [2022-11-26 00:32:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:56,114 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 2247 transitions. [2022-11-26 00:32:56,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 2247 transitions. [2022-11-26 00:32:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:32:56,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:56,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:32:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:32:56,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 80833215, now seen corresponding path program 1 times [2022-11-26 00:32:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:56,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599171388] [2022-11-26 00:32:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:56,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:56,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599171388] [2022-11-26 00:32:56,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599171388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:56,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:32:56,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:32:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116230165] [2022-11-26 00:32:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:56,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:32:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:32:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:56,240 INFO L87 Difference]: Start difference. First operand 739 states and 2247 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:56,421 INFO L93 Difference]: Finished difference Result 1021 states and 2548 transitions. [2022-11-26 00:32:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:32:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 00:32:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:56,428 INFO L225 Difference]: With dead ends: 1021 [2022-11-26 00:32:56,428 INFO L226 Difference]: Without dead ends: 1019 [2022-11-26 00:32:56,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:32:56,429 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:56,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:32:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2022-11-26 00:32:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 737. [2022-11-26 00:32:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 541 states have (on average 3.852125693160813) internal successors, (2084), 736 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 2084 transitions. [2022-11-26 00:32:56,464 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 2084 transitions. Word has length 4 [2022-11-26 00:32:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:56,464 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 2084 transitions. [2022-11-26 00:32:56,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 2084 transitions. [2022-11-26 00:32:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:32:56,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:56,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:32:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:32:56,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1788789186, now seen corresponding path program 1 times [2022-11-26 00:32:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199757776] [2022-11-26 00:32:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:56,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:56,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199757776] [2022-11-26 00:32:56,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199757776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:56,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785575388] [2022-11-26 00:32:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:56,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:56,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:32:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:57,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-26 00:32:57,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:57,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:32:57,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:32:57,222 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-11-26 00:32:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:57,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:57,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-26 00:32:57,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:32:57,328 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 22 treesize of output 23 [2022-11-26 00:32:57,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:32:57,344 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 33 treesize of output 31 [2022-11-26 00:32:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:32:57,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785575388] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:32:57,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [204718487] [2022-11-26 00:32:57,389 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-11-26 00:32:57,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:57,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-26 00:32:57,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696829972] [2022-11-26 00:32:57,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:57,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:32:57,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:57,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:32:57,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2022-11-26 00:32:57,396 INFO L87 Difference]: Start difference. First operand 737 states and 2084 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:58,186 INFO L93 Difference]: Finished difference Result 1269 states and 3323 transitions. [2022-11-26 00:32:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:32:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 5 [2022-11-26 00:32:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:58,196 INFO L225 Difference]: With dead ends: 1269 [2022-11-26 00:32:58,196 INFO L226 Difference]: Without dead ends: 1269 [2022-11-26 00:32:58,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=184, Unknown=1, NotChecked=28, Total=272 [2022-11-26 00:32:58,197 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 224 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:58,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 9 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 402 Invalid, 0 Unknown, 55 Unchecked, 0.6s Time] [2022-11-26 00:32:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2022-11-26 00:32:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 799. [2022-11-26 00:32:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 603 states have (on average 3.9203980099502487) internal successors, (2364), 798 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2364 transitions. [2022-11-26 00:32:58,233 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2364 transitions. Word has length 5 [2022-11-26 00:32:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:58,234 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2364 transitions. [2022-11-26 00:32:58,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:32:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2364 transitions. [2022-11-26 00:32:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:32:58,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:58,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:32:58,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:58,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:58,443 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:32:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1788789260, now seen corresponding path program 1 times [2022-11-26 00:32:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002145558] [2022-11-26 00:32:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:58,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:58,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002145558] [2022-11-26 00:32:58,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002145558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:58,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790430218] [2022-11-26 00:32:58,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:58,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:58,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:58,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:58,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:32:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:59,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-26 00:32:59,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:59,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:32:59,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:32:59,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:32:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:59,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:59,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_161 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-26 00:32:59,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:32:59,269 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 24 treesize of output 25 [2022-11-26 00:32:59,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:32:59,278 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 39 treesize of output 37 [2022-11-26 00:32:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:32:59,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790430218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:32:59,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813802346] [2022-11-26 00:32:59,314 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-11-26 00:32:59,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:59,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-26 00:32:59,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660552969] [2022-11-26 00:32:59,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:32:59,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:32:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:32:59,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2022-11-26 00:32:59,318 INFO L87 Difference]: Start difference. First operand 799 states and 2364 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:00,166 INFO L93 Difference]: Finished difference Result 1232 states and 3201 transitions. [2022-11-26 00:33:00,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:33:00,167 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 5 [2022-11-26 00:33:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:00,174 INFO L225 Difference]: With dead ends: 1232 [2022-11-26 00:33:00,175 INFO L226 Difference]: Without dead ends: 1232 [2022-11-26 00:33:00,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=184, Unknown=1, NotChecked=28, Total=272 [2022-11-26 00:33:00,176 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:00,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 10 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 498 Invalid, 0 Unknown, 85 Unchecked, 0.6s Time] [2022-11-26 00:33:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-26 00:33:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 798. [2022-11-26 00:33:00,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 602 states have (on average 3.8172757475083055) internal successors, (2298), 797 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2298 transitions. [2022-11-26 00:33:00,208 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2298 transitions. Word has length 5 [2022-11-26 00:33:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:00,208 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2298 transitions. [2022-11-26 00:33:00,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2298 transitions. [2022-11-26 00:33:00,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:00,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:00,210 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-26 00:33:00,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:00,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:00,416 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash 382469841, now seen corresponding path program 2 times [2022-11-26 00:33:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:00,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374648887] [2022-11-26 00:33:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:00,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:00,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374648887] [2022-11-26 00:33:00,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374648887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063499445] [2022-11-26 00:33:00,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:00,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:00,508 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:00,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:33:00,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:33:00,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:00,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:33:00,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:33:00,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:33:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063499445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:00,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:33:00,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-26 00:33:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942269844] [2022-11-26 00:33:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:00,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:00,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:33:00,698 INFO L87 Difference]: Start difference. First operand 798 states and 2298 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:00,803 INFO L93 Difference]: Finished difference Result 797 states and 2297 transitions. [2022-11-26 00:33:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:00,816 INFO L225 Difference]: With dead ends: 797 [2022-11-26 00:33:00,821 INFO L226 Difference]: Without dead ends: 797 [2022-11-26 00:33:00,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:33:00,823 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:00,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-11-26 00:33:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 794. [2022-11-26 00:33:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 599 states have (on average 3.8247078464106843) internal successors, (2291), 793 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 2291 transitions. [2022-11-26 00:33:00,850 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 2291 transitions. Word has length 6 [2022-11-26 00:33:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:00,851 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 2291 transitions. [2022-11-26 00:33:00,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 2291 transitions. [2022-11-26 00:33:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:00,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:00,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:00,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 00:33:01,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:01,061 INFO L85 PathProgramCache]: Analyzing trace with hash 382105995, now seen corresponding path program 1 times [2022-11-26 00:33:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:01,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428735430] [2022-11-26 00:33:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:01,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428735430] [2022-11-26 00:33:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428735430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267676048] [2022-11-26 00:33:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:01,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:01,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:01,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:01,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:33:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:01,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 00:33:01,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:01,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:33:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:01,897 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-11-26 00:33:01,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:01,952 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-11-26 00:33:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:01,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:02,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:02,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-26 00:33:02,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:02,144 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 63 treesize of output 61 [2022-11-26 00:33:02,149 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 48 treesize of output 44 [2022-11-26 00:33:02,156 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 22 treesize of output 20 [2022-11-26 00:33:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:02,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267676048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:02,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [666082221] [2022-11-26 00:33:02,225 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-11-26 00:33:02,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:02,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:33:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608310778] [2022-11-26 00:33:02,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:33:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:33:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=139, Unknown=6, NotChecked=0, Total=182 [2022-11-26 00:33:02,228 INFO L87 Difference]: Start difference. First operand 794 states and 2291 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:03,321 INFO L93 Difference]: Finished difference Result 3043 states and 8062 transitions. [2022-11-26 00:33:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:03,339 INFO L225 Difference]: With dead ends: 3043 [2022-11-26 00:33:03,339 INFO L226 Difference]: Without dead ends: 3043 [2022-11-26 00:33:03,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=288, Unknown=6, NotChecked=0, Total=380 [2022-11-26 00:33:03,340 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 502 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:03,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 8 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:33:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-11-26 00:33:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 857. [2022-11-26 00:33:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 662 states have (on average 3.880664652567976) internal successors, (2569), 856 states have internal predecessors, (2569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2569 transitions. [2022-11-26 00:33:03,389 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2569 transitions. Word has length 6 [2022-11-26 00:33:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:03,389 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 2569 transitions. [2022-11-26 00:33:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2569 transitions. [2022-11-26 00:33:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:03,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:03,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:03,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:03,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:33:03,605 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:03,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 382105921, now seen corresponding path program 1 times [2022-11-26 00:33:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978645556] [2022-11-26 00:33:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:04,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:04,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978645556] [2022-11-26 00:33:04,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978645556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:04,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959714037] [2022-11-26 00:33:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:04,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:04,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:04,091 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:04,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:33:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:04,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-26 00:33:04,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:04,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:33:04,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:04,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:04,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:04,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:04,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:04,424 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 9223372039002259456))) is different from false [2022-11-26 00:33:04,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-26 00:33:04,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:04,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-26 00:33:04,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:04,467 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 73 treesize of output 71 [2022-11-26 00:33:04,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-11-26 00:33:04,478 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 54 treesize of output 50 [2022-11-26 00:33:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-26 00:33:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959714037] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1226567302] [2022-11-26 00:33:04,528 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-11-26 00:33:04,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:04,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:33:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543401699] [2022-11-26 00:33:04,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:33:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:33:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=107, Unknown=2, NotChecked=42, Total=182 [2022-11-26 00:33:04,531 INFO L87 Difference]: Start difference. First operand 857 states and 2569 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:05,578 INFO L93 Difference]: Finished difference Result 2919 states and 7754 transitions. [2022-11-26 00:33:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:05,579 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:05,595 INFO L225 Difference]: With dead ends: 2919 [2022-11-26 00:33:05,595 INFO L226 Difference]: Without dead ends: 2919 [2022-11-26 00:33:05,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=241, Unknown=2, NotChecked=66, Total=380 [2022-11-26 00:33:05,596 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 413 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:05,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 10 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 551 Invalid, 0 Unknown, 267 Unchecked, 0.7s Time] [2022-11-26 00:33:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2022-11-26 00:33:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 826. [2022-11-26 00:33:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 631 states have (on average 3.8510301109350236) internal successors, (2430), 825 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2430 transitions. [2022-11-26 00:33:05,643 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2430 transitions. Word has length 6 [2022-11-26 00:33:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:05,644 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2430 transitions. [2022-11-26 00:33:05,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2430 transitions. [2022-11-26 00:33:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:05,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:05,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:05,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:33:05,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 371162792, now seen corresponding path program 1 times [2022-11-26 00:33:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:05,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045125047] [2022-11-26 00:33:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:05,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:05,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045125047] [2022-11-26 00:33:05,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045125047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:05,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:05,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:33:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700871027] [2022-11-26 00:33:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:05,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:05,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:05,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:05,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:05,904 INFO L87 Difference]: Start difference. First operand 826 states and 2430 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:05,991 INFO L93 Difference]: Finished difference Result 722 states and 2120 transitions. [2022-11-26 00:33:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:05,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:06,001 INFO L225 Difference]: With dead ends: 722 [2022-11-26 00:33:06,001 INFO L226 Difference]: Without dead ends: 722 [2022-11-26 00:33:06,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:06,002 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:06,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-11-26 00:33:06,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-11-26 00:33:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 555 states have (on average 3.81981981981982) internal successors, (2120), 721 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 2120 transitions. [2022-11-26 00:33:06,025 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 2120 transitions. Word has length 6 [2022-11-26 00:33:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:06,026 INFO L495 AbstractCegarLoop]: Abstraction has 722 states and 2120 transitions. [2022-11-26 00:33:06,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 2120 transitions. [2022-11-26 00:33:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:06,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:06,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:06,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:33:06,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 371162793, now seen corresponding path program 1 times [2022-11-26 00:33:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466694397] [2022-11-26 00:33:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:06,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:06,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466694397] [2022-11-26 00:33:06,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466694397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:06,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:06,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:33:06,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331008414] [2022-11-26 00:33:06,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:06,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:06,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:06,109 INFO L87 Difference]: Start difference. First operand 722 states and 2120 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:06,192 INFO L93 Difference]: Finished difference Result 618 states and 1810 transitions. [2022-11-26 00:33:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:06,196 INFO L225 Difference]: With dead ends: 618 [2022-11-26 00:33:06,196 INFO L226 Difference]: Without dead ends: 618 [2022-11-26 00:33:06,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:06,197 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:06,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-26 00:33:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2022-11-26 00:33:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 479 states have (on average 3.778705636743215) internal successors, (1810), 617 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1810 transitions. [2022-11-26 00:33:06,219 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1810 transitions. Word has length 6 [2022-11-26 00:33:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:06,219 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1810 transitions. [2022-11-26 00:33:06,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1810 transitions. [2022-11-26 00:33:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:06,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:06,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:06,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:33:06,220 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 371162840, now seen corresponding path program 1 times [2022-11-26 00:33:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:06,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676192665] [2022-11-26 00:33:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:06,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676192665] [2022-11-26 00:33:06,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676192665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:06,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:06,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:33:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515239274] [2022-11-26 00:33:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:06,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:33:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:33:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:33:06,421 INFO L87 Difference]: Start difference. First operand 618 states and 1810 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:06,568 INFO L93 Difference]: Finished difference Result 654 states and 1870 transitions. [2022-11-26 00:33:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:33:06,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:06,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:06,571 INFO L225 Difference]: With dead ends: 654 [2022-11-26 00:33:06,571 INFO L226 Difference]: Without dead ends: 654 [2022-11-26 00:33:06,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:33:06,572 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:06,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-11-26 00:33:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 622. [2022-11-26 00:33:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 483 states have (on average 3.8219461697722568) internal successors, (1846), 621 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1846 transitions. [2022-11-26 00:33:06,591 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1846 transitions. Word has length 6 [2022-11-26 00:33:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:06,591 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1846 transitions. [2022-11-26 00:33:06,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1846 transitions. [2022-11-26 00:33:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:06,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:06,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:06,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:33:06,593 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 371162794, now seen corresponding path program 1 times [2022-11-26 00:33:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716609349] [2022-11-26 00:33:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:06,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:06,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716609349] [2022-11-26 00:33:06,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716609349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:06,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:33:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440816380] [2022-11-26 00:33:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:06,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:06,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:06,639 INFO L87 Difference]: Start difference. First operand 622 states and 1846 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:06,773 INFO L93 Difference]: Finished difference Result 828 states and 2681 transitions. [2022-11-26 00:33:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:06,778 INFO L225 Difference]: With dead ends: 828 [2022-11-26 00:33:06,778 INFO L226 Difference]: Without dead ends: 828 [2022-11-26 00:33:06,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:06,779 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:06,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-26 00:33:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 678. [2022-11-26 00:33:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 539 states have (on average 4.4230055658627085) internal successors, (2384), 677 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 2384 transitions. [2022-11-26 00:33:06,814 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 2384 transitions. Word has length 6 [2022-11-26 00:33:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 2384 transitions. [2022-11-26 00:33:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 2384 transitions. [2022-11-26 00:33:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:06,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:06,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:06,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:33:06,816 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:06,817 INFO L85 PathProgramCache]: Analyzing trace with hash 371162731, now seen corresponding path program 1 times [2022-11-26 00:33:06,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:06,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799779679] [2022-11-26 00:33:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:06,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:06,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:06,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799779679] [2022-11-26 00:33:06,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799779679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:06,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:06,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:33:06,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145241898] [2022-11-26 00:33:06,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:06,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:33:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:33:06,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:33:06,913 INFO L87 Difference]: Start difference. First operand 678 states and 2384 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:07,109 INFO L93 Difference]: Finished difference Result 662 states and 2276 transitions. [2022-11-26 00:33:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:33:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:07,113 INFO L225 Difference]: With dead ends: 662 [2022-11-26 00:33:07,113 INFO L226 Difference]: Without dead ends: 662 [2022-11-26 00:33:07,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:33:07,114 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:07,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:33:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-26 00:33:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 658. [2022-11-26 00:33:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 519 states have (on average 4.3795761078998074) internal successors, (2273), 657 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2273 transitions. [2022-11-26 00:33:07,134 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2273 transitions. Word has length 6 [2022-11-26 00:33:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:07,135 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 2273 transitions. [2022-11-26 00:33:07,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2273 transitions. [2022-11-26 00:33:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:33:07,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:07,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:33:07,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:33:07,136 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 371162639, now seen corresponding path program 1 times [2022-11-26 00:33:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168621309] [2022-11-26 00:33:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:07,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168621309] [2022-11-26 00:33:07,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168621309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:07,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:33:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641644252] [2022-11-26 00:33:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:07,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:07,176 INFO L87 Difference]: Start difference. First operand 658 states and 2273 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:07,309 INFO L93 Difference]: Finished difference Result 802 states and 2455 transitions. [2022-11-26 00:33:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:33:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:07,313 INFO L225 Difference]: With dead ends: 802 [2022-11-26 00:33:07,313 INFO L226 Difference]: Without dead ends: 791 [2022-11-26 00:33:07,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:07,315 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:07,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-26 00:33:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 645. [2022-11-26 00:33:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 506 states have (on average 4.24901185770751) internal successors, (2150), 644 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2150 transitions. [2022-11-26 00:33:07,337 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2150 transitions. Word has length 6 [2022-11-26 00:33:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:07,337 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 2150 transitions. [2022-11-26 00:33:07,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2150 transitions. [2022-11-26 00:33:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:33:07,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:07,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:07,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 00:33:07,338 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1039405134, now seen corresponding path program 1 times [2022-11-26 00:33:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:07,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532055730] [2022-11-26 00:33:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:07,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:07,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532055730] [2022-11-26 00:33:07,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532055730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:07,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:07,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:33:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396704228] [2022-11-26 00:33:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:07,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:33:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:33:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:33:07,392 INFO L87 Difference]: Start difference. First operand 645 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:07,555 INFO L93 Difference]: Finished difference Result 619 states and 2050 transitions. [2022-11-26 00:33:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:33:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-26 00:33:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:07,559 INFO L225 Difference]: With dead ends: 619 [2022-11-26 00:33:07,559 INFO L226 Difference]: Without dead ends: 619 [2022-11-26 00:33:07,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:33:07,561 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:07,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-26 00:33:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-11-26 00:33:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 490 states have (on average 4.183673469387755) internal successors, (2050), 618 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 2050 transitions. [2022-11-26 00:33:07,586 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 2050 transitions. Word has length 7 [2022-11-26 00:33:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:07,586 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 2050 transitions. [2022-11-26 00:33:07,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 2050 transitions. [2022-11-26 00:33:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:33:07,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:07,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:33:07,588 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1039404669, now seen corresponding path program 1 times [2022-11-26 00:33:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494602713] [2022-11-26 00:33:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:07,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:07,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494602713] [2022-11-26 00:33:07,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494602713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:07,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418512023] [2022-11-26 00:33:07,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:07,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:07,707 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:07,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:33:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:07,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:33:07,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:07,942 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 69 treesize of output 53 [2022-11-26 00:33:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:07,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:33:07,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418512023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:07,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:33:07,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2022-11-26 00:33:07,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062720913] [2022-11-26 00:33:07,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:07,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:33:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:33:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:33:07,969 INFO L87 Difference]: Start difference. First operand 619 states and 2050 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:08,174 INFO L93 Difference]: Finished difference Result 589 states and 1852 transitions. [2022-11-26 00:33:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:33:08,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-26 00:33:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:08,178 INFO L225 Difference]: With dead ends: 589 [2022-11-26 00:33:08,178 INFO L226 Difference]: Without dead ends: 589 [2022-11-26 00:33:08,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:33:08,179 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:08,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:33:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-26 00:33:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 547. [2022-11-26 00:33:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 4.0181818181818185) internal successors, (1768), 546 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1768 transitions. [2022-11-26 00:33:08,198 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1768 transitions. Word has length 7 [2022-11-26 00:33:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:08,198 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1768 transitions. [2022-11-26 00:33:08,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1768 transitions. [2022-11-26 00:33:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:33:08,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:08,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:08,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:08,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:08,406 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1039637785, now seen corresponding path program 1 times [2022-11-26 00:33:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:08,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146509716] [2022-11-26 00:33:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:08,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:08,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146509716] [2022-11-26 00:33:08,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146509716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:08,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337466116] [2022-11-26 00:33:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:08,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:08,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:08,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:33:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:09,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 00:33:09,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:09,036 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 14 treesize of output 12 [2022-11-26 00:33:09,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:33:09,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 00:33:09,128 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-11-26 00:33:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:09,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:09,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_420) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))) 4294967296)) is different from false [2022-11-26 00:33:09,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:09,223 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 25 treesize of output 26 [2022-11-26 00:33:09,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:09,233 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 125 treesize of output 119 [2022-11-26 00:33:09,240 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 53 treesize of output 49 [2022-11-26 00:33:09,245 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 102 treesize of output 94 [2022-11-26 00:33:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:09,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337466116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:09,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2100141503] [2022-11-26 00:33:09,289 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-11-26 00:33:09,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:09,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-11-26 00:33:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514117475] [2022-11-26 00:33:09,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:33:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:33:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=102, Unknown=3, NotChecked=20, Total=156 [2022-11-26 00:33:09,292 INFO L87 Difference]: Start difference. First operand 547 states and 1768 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:09,907 INFO L93 Difference]: Finished difference Result 1268 states and 3692 transitions. [2022-11-26 00:33:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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 7 [2022-11-26 00:33:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:09,912 INFO L225 Difference]: With dead ends: 1268 [2022-11-26 00:33:09,913 INFO L226 Difference]: Without dead ends: 1268 [2022-11-26 00:33:09,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=177, Unknown=3, NotChecked=28, Total=272 [2022-11-26 00:33:09,914 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 428 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:09,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 0 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 345 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2022-11-26 00:33:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2022-11-26 00:33:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 547. [2022-11-26 00:33:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.809090909090909) internal successors, (1676), 546 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1676 transitions. [2022-11-26 00:33:09,935 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1676 transitions. Word has length 7 [2022-11-26 00:33:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:09,936 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1676 transitions. [2022-11-26 00:33:09,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1676 transitions. [2022-11-26 00:33:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:33:09,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:09,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:09,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:10,143 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1039637806, now seen corresponding path program 1 times [2022-11-26 00:33:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933761172] [2022-11-26 00:33:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:10,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:10,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933761172] [2022-11-26 00:33:10,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933761172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:10,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136281271] [2022-11-26 00:33:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:10,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:10,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:10,631 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:10,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:33:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:10,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 00:33:10,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:10,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:33:10,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:10,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:10,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:10,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:11,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:11,029 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_454) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))) 9223372039002259456))) is different from false [2022-11-26 00:33:11,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:11,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-26 00:33:11,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:11,108 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 73 treesize of output 71 [2022-11-26 00:33:11,113 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 56 treesize of output 52 [2022-11-26 00:33:11,120 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 26 treesize of output 24 [2022-11-26 00:33:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:11,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136281271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:11,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692867448] [2022-11-26 00:33:11,187 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-11-26 00:33:11,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:11,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-26 00:33:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490152550] [2022-11-26 00:33:11,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:11,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:33:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:11,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:33:11,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=122, Unknown=2, NotChecked=22, Total=182 [2022-11-26 00:33:11,190 INFO L87 Difference]: Start difference. First operand 547 states and 1676 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:11,893 INFO L93 Difference]: Finished difference Result 1176 states and 3420 transitions. [2022-11-26 00:33:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-26 00:33:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:11,899 INFO L225 Difference]: With dead ends: 1176 [2022-11-26 00:33:11,899 INFO L226 Difference]: Without dead ends: 1176 [2022-11-26 00:33:11,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=261, Unknown=2, NotChecked=34, Total=380 [2022-11-26 00:33:11,901 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 438 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:11,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 0 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 287 Invalid, 0 Unknown, 101 Unchecked, 0.4s Time] [2022-11-26 00:33:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-11-26 00:33:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 547. [2022-11-26 00:33:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.7045454545454546) internal successors, (1630), 546 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1630 transitions. [2022-11-26 00:33:11,942 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1630 transitions. Word has length 7 [2022-11-26 00:33:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:11,943 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1630 transitions. [2022-11-26 00:33:11,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:11,944 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1630 transitions. [2022-11-26 00:33:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:11,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:11,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:11,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-26 00:33:12,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:12,151 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:12,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2138206096, now seen corresponding path program 1 times [2022-11-26 00:33:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133729029] [2022-11-26 00:33:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:12,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:12,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133729029] [2022-11-26 00:33:12,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133729029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:12,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53195789] [2022-11-26 00:33:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:12,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:12,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:12,303 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:12,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:33:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:12,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:33:12,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:12,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:12,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53195789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:12,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1912968957] [2022-11-26 00:33:12,676 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-11-26 00:33:12,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:12,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-26 00:33:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589119207] [2022-11-26 00:33:12,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:12,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:33:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:12,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:33:12,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:33:12,679 INFO L87 Difference]: Start difference. First operand 547 states and 1630 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:13,218 INFO L93 Difference]: Finished difference Result 849 states and 2368 transitions. [2022-11-26 00:33:13,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:33:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:33:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:13,221 INFO L225 Difference]: With dead ends: 849 [2022-11-26 00:33:13,221 INFO L226 Difference]: Without dead ends: 843 [2022-11-26 00:33:13,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:33:13,222 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:13,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:33:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-11-26 00:33:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 711. [2022-11-26 00:33:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 604 states have (on average 3.524834437086093) internal successors, (2129), 710 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2129 transitions. [2022-11-26 00:33:13,244 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2129 transitions. Word has length 8 [2022-11-26 00:33:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:13,245 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 2129 transitions. [2022-11-26 00:33:13,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2129 transitions. [2022-11-26 00:33:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:13,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:13,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:13,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 00:33:13,459 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2130973037, now seen corresponding path program 1 times [2022-11-26 00:33:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:13,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411324758] [2022-11-26 00:33:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:13,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:13,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411324758] [2022-11-26 00:33:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411324758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:13,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:33:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270757065] [2022-11-26 00:33:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:13,654 INFO L87 Difference]: Start difference. First operand 711 states and 2129 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:13,725 INFO L93 Difference]: Finished difference Result 591 states and 1771 transitions. [2022-11-26 00:33:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:13,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-26 00:33:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:13,728 INFO L225 Difference]: With dead ends: 591 [2022-11-26 00:33:13,729 INFO L226 Difference]: Without dead ends: 591 [2022-11-26 00:33:13,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:33:13,729 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:13,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-11-26 00:33:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2022-11-26 00:33:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 508 states have (on average 3.486220472440945) internal successors, (1771), 590 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1771 transitions. [2022-11-26 00:33:13,752 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1771 transitions. Word has length 8 [2022-11-26 00:33:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:13,753 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 1771 transitions. [2022-11-26 00:33:13,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1771 transitions. [2022-11-26 00:33:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:13,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:13,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:13,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 00:33:13,754 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2130972974, now seen corresponding path program 1 times [2022-11-26 00:33:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:13,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843265112] [2022-11-26 00:33:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:13,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843265112] [2022-11-26 00:33:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843265112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126982360] [2022-11-26 00:33:13,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:13,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:13,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:13,986 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:14,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:33:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:14,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:33:14,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:14,669 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 149 treesize of output 133 [2022-11-26 00:33:14,751 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 106 treesize of output 98 [2022-11-26 00:33:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:14,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:15,543 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 552 treesize of output 504 [2022-11-26 00:33:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:15,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126982360] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:15,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [736897827] [2022-11-26 00:33:15,915 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-11-26 00:33:15,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:15,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-11-26 00:33:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094458877] [2022-11-26 00:33:15,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:15,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:33:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:33:15,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:33:15,918 INFO L87 Difference]: Start difference. First operand 591 states and 1771 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:16,246 INFO L93 Difference]: Finished difference Result 567 states and 1605 transitions. [2022-11-26 00:33:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:33:16,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:33:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:16,250 INFO L225 Difference]: With dead ends: 567 [2022-11-26 00:33:16,250 INFO L226 Difference]: Without dead ends: 567 [2022-11-26 00:33:16,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-26 00:33:16,251 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:16,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:33:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-26 00:33:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 543. [2022-11-26 00:33:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 460 states have (on average 3.4391304347826086) internal successors, (1582), 542 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1582 transitions. [2022-11-26 00:33:16,266 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1582 transitions. Word has length 8 [2022-11-26 00:33:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:16,267 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1582 transitions. [2022-11-26 00:33:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1582 transitions. [2022-11-26 00:33:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:16,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:16,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:16,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-26 00:33:16,474 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2130972882, now seen corresponding path program 1 times [2022-11-26 00:33:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:16,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399960098] [2022-11-26 00:33:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:16,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:16,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399960098] [2022-11-26 00:33:16,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399960098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729417668] [2022-11-26 00:33:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:16,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:16,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:16,690 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:16,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:33:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:16,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:33:16,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:17,309 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 464 treesize of output 416 [2022-11-26 00:33:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:17,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:18,219 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 546 treesize of output 498 [2022-11-26 00:33:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:18,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729417668] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:18,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:33:18,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2022-11-26 00:33:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002626114] [2022-11-26 00:33:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:18,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:33:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:18,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:33:18,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:33:18,350 INFO L87 Difference]: Start difference. First operand 543 states and 1582 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:18,424 INFO L93 Difference]: Finished difference Result 483 states and 1395 transitions. [2022-11-26 00:33:18,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:33:18,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-26 00:33:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:18,427 INFO L225 Difference]: With dead ends: 483 [2022-11-26 00:33:18,427 INFO L226 Difference]: Without dead ends: 455 [2022-11-26 00:33:18,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:33:18,428 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:18,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:33:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-26 00:33:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-11-26 00:33:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 384 states have (on average 3.4609375) internal successors, (1329), 454 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1329 transitions. [2022-11-26 00:33:18,442 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1329 transitions. Word has length 8 [2022-11-26 00:33:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:18,442 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1329 transitions. [2022-11-26 00:33:18,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1329 transitions. [2022-11-26 00:33:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:18,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:18,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:18,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:18,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-26 00:33:18,649 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2139748338, now seen corresponding path program 1 times [2022-11-26 00:33:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:18,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928594930] [2022-11-26 00:33:18,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:18,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:18,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:18,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928594930] [2022-11-26 00:33:18,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928594930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180678352] [2022-11-26 00:33:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:18,871 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:18,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:33:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:19,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:33:19,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:19,457 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 63 treesize of output 23 [2022-11-26 00:33:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:19,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:19,714 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 307 treesize of output 267 [2022-11-26 00:33:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:19,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180678352] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:19,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:33:19,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2022-11-26 00:33:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290669835] [2022-11-26 00:33:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:19,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:33:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:33:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:33:19,801 INFO L87 Difference]: Start difference. First operand 455 states and 1329 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:20,034 INFO L93 Difference]: Finished difference Result 770 states and 2139 transitions. [2022-11-26 00:33:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:33:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-26 00:33:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:20,040 INFO L225 Difference]: With dead ends: 770 [2022-11-26 00:33:20,040 INFO L226 Difference]: Without dead ends: 770 [2022-11-26 00:33:20,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:33:20,042 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:20,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:33:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-26 00:33:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 525. [2022-11-26 00:33:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 454 states have (on average 3.616740088105727) internal successors, (1642), 524 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1642 transitions. [2022-11-26 00:33:20,063 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1642 transitions. Word has length 8 [2022-11-26 00:33:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:20,063 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 1642 transitions. [2022-11-26 00:33:20,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1642 transitions. [2022-11-26 00:33:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:33:20,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:20,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:20,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:20,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-26 00:33:20,271 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2139748498, now seen corresponding path program 1 times [2022-11-26 00:33:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:20,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123085055] [2022-11-26 00:33:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:20,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:20,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:20,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123085055] [2022-11-26 00:33:20,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123085055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:33:20,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:33:20,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:33:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815256507] [2022-11-26 00:33:20,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:33:20,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:33:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:20,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:33:20,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:33:20,526 INFO L87 Difference]: Start difference. First operand 525 states and 1642 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:20,760 INFO L93 Difference]: Finished difference Result 750 states and 2065 transitions. [2022-11-26 00:33:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:33:20,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-26 00:33:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:20,765 INFO L225 Difference]: With dead ends: 750 [2022-11-26 00:33:20,765 INFO L226 Difference]: Without dead ends: 713 [2022-11-26 00:33:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:33:20,766 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:20,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:33:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-26 00:33:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 492. [2022-11-26 00:33:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 421 states have (on average 3.6318289786223277) internal successors, (1529), 491 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1529 transitions. [2022-11-26 00:33:20,782 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1529 transitions. Word has length 8 [2022-11-26 00:33:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:20,783 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1529 transitions. [2022-11-26 00:33:20,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1529 transitions. [2022-11-26 00:33:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:20,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:20,784 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:20,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-26 00:33:20,784 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:20,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:20,785 INFO L85 PathProgramCache]: Analyzing trace with hash -726391540, now seen corresponding path program 2 times [2022-11-26 00:33:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:20,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057748449] [2022-11-26 00:33:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:21,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:21,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057748449] [2022-11-26 00:33:21,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057748449] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:21,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665552470] [2022-11-26 00:33:21,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:21,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:21,235 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:21,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 00:33:21,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:33:21,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:21,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 00:33:21,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:21,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:33:21,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:21,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:21,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:21,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:21,929 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 26 treesize of output 27 [2022-11-26 00:33:21,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:21,940 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 41 treesize of output 37 [2022-11-26 00:33:21,946 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 13 treesize of output 7 [2022-11-26 00:33:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:22,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665552470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690413962] [2022-11-26 00:33:22,107 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-11-26 00:33:22,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:22,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 00:33:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629293059] [2022-11-26 00:33:22,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:22,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:33:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:33:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:33:22,110 INFO L87 Difference]: Start difference. First operand 492 states and 1529 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:25,643 INFO L93 Difference]: Finished difference Result 1267 states and 3683 transitions. [2022-11-26 00:33:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-26 00:33:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:25,650 INFO L225 Difference]: With dead ends: 1267 [2022-11-26 00:33:25,651 INFO L226 Difference]: Without dead ends: 1267 [2022-11-26 00:33:25,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=280, Invalid=1280, Unknown=0, NotChecked=0, Total=1560 [2022-11-26 00:33:25,652 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:25,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-26 00:33:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-11-26 00:33:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 753. [2022-11-26 00:33:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 682 states have (on average 4.077712609970675) internal successors, (2781), 752 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 2781 transitions. [2022-11-26 00:33:25,681 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 2781 transitions. Word has length 9 [2022-11-26 00:33:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:25,682 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 2781 transitions. [2022-11-26 00:33:25,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 2781 transitions. [2022-11-26 00:33:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:25,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:25,683 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:25,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:25,889 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -726391614, now seen corresponding path program 1 times [2022-11-26 00:33:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:25,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685418682] [2022-11-26 00:33:25,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:26,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:26,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685418682] [2022-11-26 00:33:26,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685418682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912827610] [2022-11-26 00:33:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:26,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:26,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:26,347 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:26,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 00:33:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:26,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-26 00:33:26,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:26,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:26,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:26,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:26,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:26,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:26,938 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 26 treesize of output 27 [2022-11-26 00:33:26,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:26,948 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 43 treesize of output 39 [2022-11-26 00:33:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:27,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912827610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:27,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774923882] [2022-11-26 00:33:27,022 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-11-26 00:33:27,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:27,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 00:33:27,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367446540] [2022-11-26 00:33:27,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:27,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:33:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:33:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=329, Unknown=2, NotChecked=0, Total=380 [2022-11-26 00:33:27,025 INFO L87 Difference]: Start difference. First operand 753 states and 2781 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:28,000 INFO L93 Difference]: Finished difference Result 929 states and 3141 transitions. [2022-11-26 00:33:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:33:28,001 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:28,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:28,005 INFO L225 Difference]: With dead ends: 929 [2022-11-26 00:33:28,006 INFO L226 Difference]: Without dead ends: 929 [2022-11-26 00:33:28,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=685, Unknown=2, NotChecked=0, Total=812 [2022-11-26 00:33:28,007 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:28,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:33:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-26 00:33:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 767. [2022-11-26 00:33:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 696 states have (on average 4.064655172413793) internal successors, (2829), 766 states have internal predecessors, (2829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2829 transitions. [2022-11-26 00:33:28,034 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2829 transitions. Word has length 9 [2022-11-26 00:33:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:28,034 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2829 transitions. [2022-11-26 00:33:28,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2829 transitions. [2022-11-26 00:33:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:28,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:28,035 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:28,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:28,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-26 00:33:28,242 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:28,243 INFO L85 PathProgramCache]: Analyzing trace with hash -733624662, now seen corresponding path program 2 times [2022-11-26 00:33:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:28,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799091700] [2022-11-26 00:33:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:28,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799091700] [2022-11-26 00:33:28,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799091700] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413826152] [2022-11-26 00:33:28,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:28,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:28,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:28,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 00:33:29,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:33:29,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:29,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 00:33:29,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:29,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:29,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:29,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:29,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:29,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:29,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:30,987 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 .cse1) (< (+ .cse1 2147483648) 0))))) is different from false [2022-11-26 00:33:31,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:31,002 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 80 treesize of output 56 [2022-11-26 00:33:31,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:31,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 383 treesize of output 367 [2022-11-26 00:33:31,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:31,034 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 344 treesize of output 312 [2022-11-26 00:33:31,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:31,051 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 166 treesize of output 150 [2022-11-26 00:33:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:33:31,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413826152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:31,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341180300] [2022-11-26 00:33:31,443 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-11-26 00:33:31,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:31,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 00:33:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374437236] [2022-11-26 00:33:31,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:31,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:33:31,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:33:31,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=4, NotChecked=34, Total=380 [2022-11-26 00:33:31,446 INFO L87 Difference]: Start difference. First operand 767 states and 2829 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:33,933 INFO L93 Difference]: Finished difference Result 1856 states and 6224 transitions. [2022-11-26 00:33:33,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:33:33,933 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:33,940 INFO L225 Difference]: With dead ends: 1856 [2022-11-26 00:33:33,941 INFO L226 Difference]: Without dead ends: 1856 [2022-11-26 00:33:33,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=4, NotChecked=70, Total=1406 [2022-11-26 00:33:33,942 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 831 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:33,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 0 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1076 Invalid, 0 Unknown, 219 Unchecked, 1.2s Time] [2022-11-26 00:33:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2022-11-26 00:33:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 992. [2022-11-26 00:33:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 921 states have (on average 4.627578718783931) internal successors, (4262), 991 states have internal predecessors, (4262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 4262 transitions. [2022-11-26 00:33:33,985 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 4262 transitions. Word has length 9 [2022-11-26 00:33:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:33,986 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 4262 transitions. [2022-11-26 00:33:33,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 4262 transitions. [2022-11-26 00:33:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:33,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:33,987 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:33,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:34,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:34,193 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash -733624580, now seen corresponding path program 1 times [2022-11-26 00:33:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011167484] [2022-11-26 00:33:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:34,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:34,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011167484] [2022-11-26 00:33:34,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011167484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:34,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001421312] [2022-11-26 00:33:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:34,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:34,519 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:34,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 00:33:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:34,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:33:34,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:35,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:36,148 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 00:33:36,149 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 636 treesize of output 540 [2022-11-26 00:33:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:36,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001421312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:36,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319968743] [2022-11-26 00:33:36,444 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-11-26 00:33:36,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-11-26 00:33:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195997813] [2022-11-26 00:33:36,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:36,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:33:36,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:33:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:33:36,449 INFO L87 Difference]: Start difference. First operand 992 states and 4262 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:36,875 INFO L93 Difference]: Finished difference Result 1230 states and 4638 transitions. [2022-11-26 00:33:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:33:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 9 [2022-11-26 00:33:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:36,880 INFO L225 Difference]: With dead ends: 1230 [2022-11-26 00:33:36,881 INFO L226 Difference]: Without dead ends: 1230 [2022-11-26 00:33:36,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:33:36,882 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:36,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:33:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2022-11-26 00:33:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 992. [2022-11-26 00:33:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 921 states have (on average 4.3496199782844736) internal successors, (4006), 991 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:36,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 4006 transitions. [2022-11-26 00:33:36,915 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 4006 transitions. Word has length 9 [2022-11-26 00:33:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:36,916 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 4006 transitions. [2022-11-26 00:33:36,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 4006 transitions. [2022-11-26 00:33:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:36,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:36,917 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:36,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-26 00:33:37,123 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash -733624683, now seen corresponding path program 1 times [2022-11-26 00:33:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:37,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358210436] [2022-11-26 00:33:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:37,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358210436] [2022-11-26 00:33:37,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358210436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589748834] [2022-11-26 00:33:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:37,731 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:37,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-26 00:33:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:37,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 00:33:37,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:38,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:38,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:38,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:38,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:38,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:38,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:39,534 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_770 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_770) c_~A~0.base)) (.cse1 (* c_~j~0 4))) (let ((.cse2 (select .cse0 (+ c_~A~0.offset .cse1)))) (or (< 0 (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= .cse2 4294967295)) (not (<= 0 (+ 9223372039002259455 .cse2))))))) is different from false [2022-11-26 00:33:39,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_770 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_770) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< 0 (+ (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ 2147483648 .cse0) 0))))) is different from false [2022-11-26 00:33:39,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:39,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 82 treesize of output 58 [2022-11-26 00:33:39,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:39,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 189 [2022-11-26 00:33:39,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:39,628 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 164 treesize of output 148 [2022-11-26 00:33:39,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:39,643 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 77 treesize of output 69 [2022-11-26 00:33:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:33:39,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589748834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:39,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362942137] [2022-11-26 00:33:39,842 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-11-26 00:33:39,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:39,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 00:33:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662052488] [2022-11-26 00:33:39,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:39,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:33:39,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:33:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=265, Unknown=2, NotChecked=66, Total=380 [2022-11-26 00:33:39,845 INFO L87 Difference]: Start difference. First operand 992 states and 4006 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:42,100 INFO L93 Difference]: Finished difference Result 1396 states and 4619 transitions. [2022-11-26 00:33:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:33:42,100 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:42,104 INFO L225 Difference]: With dead ends: 1396 [2022-11-26 00:33:42,104 INFO L226 Difference]: Without dead ends: 1396 [2022-11-26 00:33:42,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=187, Invalid=941, Unknown=2, NotChecked=130, Total=1260 [2022-11-26 00:33:42,105 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 729 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:42,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 0 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1166 Invalid, 0 Unknown, 265 Unchecked, 1.1s Time] [2022-11-26 00:33:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2022-11-26 00:33:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 964. [2022-11-26 00:33:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 893 states have (on average 4.134378499440089) internal successors, (3692), 963 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 3692 transitions. [2022-11-26 00:33:42,142 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 3692 transitions. Word has length 9 [2022-11-26 00:33:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:42,142 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 3692 transitions. [2022-11-26 00:33:42,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 3692 transitions. [2022-11-26 00:33:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:42,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:42,144 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:42,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:42,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:42,351 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -724849111, now seen corresponding path program 1 times [2022-11-26 00:33:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011833994] [2022-11-26 00:33:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:42,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011833994] [2022-11-26 00:33:42,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011833994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:42,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097864560] [2022-11-26 00:33:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:42,599 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:42,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-26 00:33:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:42,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:33:42,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:43,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:43,575 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-26 00:33:43,576 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 341 treesize of output 284 [2022-11-26 00:33:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:43,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097864560] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:43,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215863134] [2022-11-26 00:33:43,730 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-11-26 00:33:43,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:43,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-26 00:33:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015297939] [2022-11-26 00:33:43,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:43,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:33:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:33:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:33:43,733 INFO L87 Difference]: Start difference. First operand 964 states and 3692 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:44,407 INFO L93 Difference]: Finished difference Result 1962 states and 6809 transitions. [2022-11-26 00:33:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:33:44,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 9 [2022-11-26 00:33:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:44,413 INFO L225 Difference]: With dead ends: 1962 [2022-11-26 00:33:44,413 INFO L226 Difference]: Without dead ends: 1962 [2022-11-26 00:33:44,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:33:44,414 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:44,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:33:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-11-26 00:33:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1135. [2022-11-26 00:33:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1064 states have (on average 4.2631578947368425) internal successors, (4536), 1134 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 4536 transitions. [2022-11-26 00:33:44,455 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 4536 transitions. Word has length 9 [2022-11-26 00:33:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:44,456 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 4536 transitions. [2022-11-26 00:33:44,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 4536 transitions. [2022-11-26 00:33:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:44,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:44,457 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:44,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:44,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-26 00:33:44,664 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash -724849107, now seen corresponding path program 1 times [2022-11-26 00:33:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:44,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63265408] [2022-11-26 00:33:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:44,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63265408] [2022-11-26 00:33:44,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63265408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656035806] [2022-11-26 00:33:44,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:44,845 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:44,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 00:33:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:45,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:33:45,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:45,461 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 24 treesize of output 12 [2022-11-26 00:33:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:45,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:45,700 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 307 treesize of output 267 [2022-11-26 00:33:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:33:45,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656035806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:45,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2041167320] [2022-11-26 00:33:45,824 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-11-26 00:33:45,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:45,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-26 00:33:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316049110] [2022-11-26 00:33:45,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:45,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:33:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:33:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:33:45,828 INFO L87 Difference]: Start difference. First operand 1135 states and 4536 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:46,334 INFO L93 Difference]: Finished difference Result 1629 states and 5581 transitions. [2022-11-26 00:33:46,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:33:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:46,339 INFO L225 Difference]: With dead ends: 1629 [2022-11-26 00:33:46,339 INFO L226 Difference]: Without dead ends: 1629 [2022-11-26 00:33:46,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-11-26 00:33:46,340 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:46,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:33:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-11-26 00:33:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 984. [2022-11-26 00:33:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 913 states have (on average 4.104052573932092) internal successors, (3747), 983 states have internal predecessors, (3747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3747 transitions. [2022-11-26 00:33:46,375 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3747 transitions. Word has length 9 [2022-11-26 00:33:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 3747 transitions. [2022-11-26 00:33:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3747 transitions. [2022-11-26 00:33:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:46,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:46,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:46,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:46,583 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1904530631, now seen corresponding path program 1 times [2022-11-26 00:33:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:46,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219970570] [2022-11-26 00:33:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:46,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:46,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219970570] [2022-11-26 00:33:46,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219970570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:46,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254352861] [2022-11-26 00:33:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:46,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:46,988 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:47,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-26 00:33:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:47,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:33:47,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:47,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:47,604 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 31 treesize of output 31 [2022-11-26 00:33:47,625 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 36 treesize of output 12 [2022-11-26 00:33:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:47,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:47,817 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 327 treesize of output 287 [2022-11-26 00:33:47,835 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 15 treesize of output 9 [2022-11-26 00:33:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:48,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254352861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:48,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727026511] [2022-11-26 00:33:48,133 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-11-26 00:33:48,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:48,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-26 00:33:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997100094] [2022-11-26 00:33:48,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:48,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 00:33:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 00:33:48,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=188, Unknown=2, NotChecked=0, Total=240 [2022-11-26 00:33:48,136 INFO L87 Difference]: Start difference. First operand 984 states and 3747 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:49,989 INFO L93 Difference]: Finished difference Result 3578 states and 12401 transitions. [2022-11-26 00:33:49,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-26 00:33:49,990 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 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 9 [2022-11-26 00:33:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:49,998 INFO L225 Difference]: With dead ends: 3578 [2022-11-26 00:33:49,998 INFO L226 Difference]: Without dead ends: 3578 [2022-11-26 00:33:49,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=344, Invalid=1057, Unknown=5, NotChecked=0, Total=1406 [2022-11-26 00:33:49,999 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 720 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 121 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:50,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 455 Invalid, 6 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:33:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2022-11-26 00:33:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 1105. [2022-11-26 00:33:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1034 states have (on average 4.191489361702128) internal successors, (4334), 1104 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 4334 transitions. [2022-11-26 00:33:50,061 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 4334 transitions. Word has length 9 [2022-11-26 00:33:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:50,061 INFO L495 AbstractCegarLoop]: Abstraction has 1105 states and 4334 transitions. [2022-11-26 00:33:50,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 4334 transitions. [2022-11-26 00:33:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:33:50,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:50,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:50,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-26 00:33:50,269 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1904530791, now seen corresponding path program 1 times [2022-11-26 00:33:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:50,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950259245] [2022-11-26 00:33:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:50,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:50,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950259245] [2022-11-26 00:33:50,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950259245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:50,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140097840] [2022-11-26 00:33:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:50,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:50,540 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:50,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 00:33:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:50,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 00:33:50,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:51,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:51,113 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 58 treesize of output 54 [2022-11-26 00:33:51,149 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 63 treesize of output 23 [2022-11-26 00:33:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:51,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:51,351 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 310 treesize of output 270 [2022-11-26 00:33:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:33:51,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140097840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:51,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [889816115] [2022-11-26 00:33:51,488 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-11-26 00:33:51,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:51,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-26 00:33:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363830609] [2022-11-26 00:33:51,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:51,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:33:51,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:33:51,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:33:51,492 INFO L87 Difference]: Start difference. First operand 1105 states and 4334 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:51,760 INFO L93 Difference]: Finished difference Result 996 states and 3816 transitions. [2022-11-26 00:33:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:33:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:33:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:51,763 INFO L225 Difference]: With dead ends: 996 [2022-11-26 00:33:51,763 INFO L226 Difference]: Without dead ends: 972 [2022-11-26 00:33:51,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:33:51,767 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:33:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-11-26 00:33:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 781. [2022-11-26 00:33:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 734 states have (on average 3.9863760217983653) internal successors, (2926), 780 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 2926 transitions. [2022-11-26 00:33:51,797 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 2926 transitions. Word has length 9 [2022-11-26 00:33:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:51,797 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 2926 transitions. [2022-11-26 00:33:51,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 2926 transitions. [2022-11-26 00:33:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:33:51,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:51,803 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:51,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:52,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-26 00:33:52,011 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1051135017, now seen corresponding path program 1 times [2022-11-26 00:33:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:52,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555464405] [2022-11-26 00:33:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:52,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555464405] [2022-11-26 00:33:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555464405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977455944] [2022-11-26 00:33:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:52,511 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:52,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-26 00:33:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:52,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:33:52,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:52,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:52,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:52,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:52,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:52,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:52,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:53,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:53,144 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 27 treesize of output 28 [2022-11-26 00:33:53,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:53,153 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 71 treesize of output 67 [2022-11-26 00:33:53,157 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 54 treesize of output 46 [2022-11-26 00:33:53,163 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 24 treesize of output 20 [2022-11-26 00:33:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:53,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977455944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:53,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1978449476] [2022-11-26 00:33:53,246 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-11-26 00:33:53,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:53,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 00:33:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826517126] [2022-11-26 00:33:53,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:33:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:33:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=428, Unknown=9, NotChecked=0, Total=506 [2022-11-26 00:33:53,249 INFO L87 Difference]: Start difference. First operand 781 states and 2926 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:53,852 INFO L93 Difference]: Finished difference Result 1610 states and 5367 transitions. [2022-11-26 00:33:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:33:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:33:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:53,856 INFO L225 Difference]: With dead ends: 1610 [2022-11-26 00:33:53,857 INFO L226 Difference]: Without dead ends: 1610 [2022-11-26 00:33:53,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=620, Unknown=9, NotChecked=0, Total=756 [2022-11-26 00:33:53,857 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 184 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:53,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:33:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2022-11-26 00:33:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 937. [2022-11-26 00:33:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 890 states have (on average 4.0539325842696625) internal successors, (3608), 936 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 3608 transitions. [2022-11-26 00:33:53,899 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 3608 transitions. Word has length 10 [2022-11-26 00:33:53,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:53,899 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 3608 transitions. [2022-11-26 00:33:53,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 3608 transitions. [2022-11-26 00:33:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:33:53,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:53,900 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:53,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-26 00:33:54,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-26 00:33:54,100 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1051135091, now seen corresponding path program 1 times [2022-11-26 00:33:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:54,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777053319] [2022-11-26 00:33:54,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:54,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:54,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:54,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777053319] [2022-11-26 00:33:54,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777053319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:54,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261590668] [2022-11-26 00:33:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:54,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:54,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:54,515 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:54,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-26 00:33:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:54,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 00:33:54,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:54,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:54,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:54,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:54,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:54,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:33:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:55,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:55,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-26 00:33:55,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:55,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-26 00:33:55,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:55,207 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 81 treesize of output 77 [2022-11-26 00:33:55,211 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 62 treesize of output 54 [2022-11-26 00:33:55,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-26 00:33:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:33:55,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261590668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:55,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502664188] [2022-11-26 00:33:55,304 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-11-26 00:33:55,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:55,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 00:33:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885432252] [2022-11-26 00:33:55,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:55,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:33:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:33:55,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=4, NotChecked=40, Total=506 [2022-11-26 00:33:55,308 INFO L87 Difference]: Start difference. First operand 937 states and 3608 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:56,193 INFO L93 Difference]: Finished difference Result 1577 states and 5239 transitions. [2022-11-26 00:33:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:33:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:33:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:56,198 INFO L225 Difference]: With dead ends: 1577 [2022-11-26 00:33:56,198 INFO L226 Difference]: Without dead ends: 1577 [2022-11-26 00:33:56,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=4, NotChecked=56, Total=930 [2022-11-26 00:33:56,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:56,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 454 Invalid, 0 Unknown, 59 Unchecked, 0.5s Time] [2022-11-26 00:33:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-11-26 00:33:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 937. [2022-11-26 00:33:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 890 states have (on average 3.995505617977528) internal successors, (3556), 936 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 3556 transitions. [2022-11-26 00:33:56,229 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 3556 transitions. Word has length 10 [2022-11-26 00:33:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 3556 transitions. [2022-11-26 00:33:56,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 3556 transitions. [2022-11-26 00:33:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:33:56,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:56,231 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:56,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:56,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-26 00:33:56,438 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1043305347, now seen corresponding path program 2 times [2022-11-26 00:33:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:56,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245793889] [2022-11-26 00:33:56,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:56,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245793889] [2022-11-26 00:33:56,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245793889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:56,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85976321] [2022-11-26 00:33:56,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:56,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:56,917 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:56,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-26 00:33:57,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:33:57,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:57,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:33:57,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:57,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:33:57,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:57,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:57,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:57,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:33:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:57,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:57,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1005 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1005) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-26 00:33:57,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:57,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 27 treesize of output 28 [2022-11-26 00:33:57,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:33:57,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-26 00:33:57,675 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 118 treesize of output 102 [2022-11-26 00:33:57,680 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 102 treesize of output 94 [2022-11-26 00:33:57,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:33:57,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85976321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:57,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572646114] [2022-11-26 00:33:57,776 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-11-26 00:33:57,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:57,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 00:33:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697225806] [2022-11-26 00:33:57,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:57,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:33:57,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:33:57,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=388, Unknown=10, NotChecked=40, Total=506 [2022-11-26 00:33:57,779 INFO L87 Difference]: Start difference. First operand 937 states and 3556 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:58,718 INFO L93 Difference]: Finished difference Result 1704 states and 5669 transitions. [2022-11-26 00:33:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:33:58,719 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:33:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:58,722 INFO L225 Difference]: With dead ends: 1704 [2022-11-26 00:33:58,723 INFO L226 Difference]: Without dead ends: 1704 [2022-11-26 00:33:58,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=579, Unknown=10, NotChecked=50, Total=756 [2022-11-26 00:33:58,723 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:58,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 771 Invalid, 0 Unknown, 91 Unchecked, 0.8s Time] [2022-11-26 00:33:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2022-11-26 00:33:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 956. [2022-11-26 00:33:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 909 states have (on average 4.028602860286028) internal successors, (3662), 955 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 3662 transitions. [2022-11-26 00:33:58,750 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 3662 transitions. Word has length 10 [2022-11-26 00:33:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:58,751 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 3662 transitions. [2022-11-26 00:33:58,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:33:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 3662 transitions. [2022-11-26 00:33:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:33:58,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:58,752 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:58,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-26 00:33:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:58,958 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:33:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1043305421, now seen corresponding path program 2 times [2022-11-26 00:33:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:58,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758244436] [2022-11-26 00:33:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:59,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758244436] [2022-11-26 00:33:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758244436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246800000] [2022-11-26 00:33:59,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:59,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:59,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:59,403 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:59,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-26 00:33:59,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:33:59,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:59,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-26 00:33:59,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:59,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:33:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:33:59,848 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 20 treesize of output 22 [2022-11-26 00:34:00,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:00,033 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 20 treesize of output 22 [2022-11-26 00:34:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:00,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:00,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:00,442 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 31 treesize of output 32 [2022-11-26 00:34:00,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:00,454 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 175 treesize of output 163 [2022-11-26 00:34:00,461 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 146 treesize of output 134 [2022-11-26 00:34:00,468 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 134 treesize of output 110 [2022-11-26 00:34:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:00,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246800000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:00,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [742028676] [2022-11-26 00:34:00,755 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-11-26 00:34:00,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:00,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 00:34:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888604120] [2022-11-26 00:34:00,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:00,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:34:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:00,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:34:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=435, Unknown=6, NotChecked=0, Total=506 [2022-11-26 00:34:00,757 INFO L87 Difference]: Start difference. First operand 956 states and 3662 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:07,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:10,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:34:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:10,500 INFO L93 Difference]: Finished difference Result 2682 states and 8098 transitions. [2022-11-26 00:34:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:34:10,501 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:34:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:10,507 INFO L225 Difference]: With dead ends: 2682 [2022-11-26 00:34:10,507 INFO L226 Difference]: Without dead ends: 2682 [2022-11-26 00:34:10,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=477, Invalid=2373, Unknown=12, NotChecked=0, Total=2862 [2022-11-26 00:34:10,508 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 918 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 116 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:10,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 0 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1430 Invalid, 13 Unknown, 0 Unchecked, 6.9s Time] [2022-11-26 00:34:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2022-11-26 00:34:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1271. [2022-11-26 00:34:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1224 states have (on average 3.9199346405228757) internal successors, (4798), 1270 states have internal predecessors, (4798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 4798 transitions. [2022-11-26 00:34:10,551 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 4798 transitions. Word has length 10 [2022-11-26 00:34:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:10,551 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 4798 transitions. [2022-11-26 00:34:10,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 4798 transitions. [2022-11-26 00:34:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:34:10,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:10,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:10,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:10,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-26 00:34:10,759 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:34:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1267522019, now seen corresponding path program 2 times [2022-11-26 00:34:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:10,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921190588] [2022-11-26 00:34:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:11,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:11,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921190588] [2022-11-26 00:34:11,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921190588] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:11,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680724834] [2022-11-26 00:34:11,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:34:11,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:11,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:11,043 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:11,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-26 00:34:11,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:34:11,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:34:11,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:34:11,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:12,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:14,283 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-26 00:34:14,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 814 treesize of output 630 [2022-11-26 00:34:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680724834] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:15,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1913044492] [2022-11-26 00:34:15,018 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-11-26 00:34:15,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:15,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 00:34:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932236627] [2022-11-26 00:34:15,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:15,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:34:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:34:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:34:15,024 INFO L87 Difference]: Start difference. First operand 1271 states and 4798 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:16,244 INFO L93 Difference]: Finished difference Result 1373 states and 4651 transitions. [2022-11-26 00:34:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:34:16,244 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:34:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:16,247 INFO L225 Difference]: With dead ends: 1373 [2022-11-26 00:34:16,247 INFO L226 Difference]: Without dead ends: 1359 [2022-11-26 00:34:16,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:34:16,248 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:16,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:34:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-26 00:34:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1185. [2022-11-26 00:34:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1138 states have (on average 3.680140597539543) internal successors, (4188), 1184 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 4188 transitions. [2022-11-26 00:34:16,279 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 4188 transitions. Word has length 10 [2022-11-26 00:34:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:16,279 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 4188 transitions. [2022-11-26 00:34:16,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 4188 transitions. [2022-11-26 00:34:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:34:16,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:16,280 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:16,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:16,486 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:34:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash -998649978, now seen corresponding path program 1 times [2022-11-26 00:34:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:16,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027073595] [2022-11-26 00:34:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:16,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:16,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027073595] [2022-11-26 00:34:16,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027073595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:16,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064266117] [2022-11-26 00:34:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:16,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:16,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:16,832 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:16,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-26 00:34:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:17,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:34:17,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:17,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-26 00:34:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:17,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:19,980 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-26 00:34:19,981 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 409 treesize of output 352 [2022-11-26 00:34:20,014 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 00:34:20,014 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 74 treesize of output 50 [2022-11-26 00:34:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:20,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064266117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939340640] [2022-11-26 00:34:20,501 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-11-26 00:34:20,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:20,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-26 00:34:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831427719] [2022-11-26 00:34:20,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:20,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:34:20,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:20,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:34:20,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=218, Unknown=1, NotChecked=0, Total=272 [2022-11-26 00:34:20,504 INFO L87 Difference]: Start difference. First operand 1185 states and 4188 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:21,418 INFO L93 Difference]: Finished difference Result 1765 states and 5536 transitions. [2022-11-26 00:34:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:34:21,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:34:21,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:21,423 INFO L225 Difference]: With dead ends: 1765 [2022-11-26 00:34:21,423 INFO L226 Difference]: Without dead ends: 1765 [2022-11-26 00:34:21,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=452, Unknown=1, NotChecked=0, Total=600 [2022-11-26 00:34:21,424 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 377 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:21,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 0 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:34:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-11-26 00:34:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1230. [2022-11-26 00:34:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1183 states have (on average 3.644125105663567) internal successors, (4311), 1229 states have internal predecessors, (4311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 4311 transitions. [2022-11-26 00:34:21,452 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 4311 transitions. Word has length 10 [2022-11-26 00:34:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:21,452 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 4311 transitions. [2022-11-26 00:34:21,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 4311 transitions. [2022-11-26 00:34:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:34:21,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:21,458 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:21,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:21,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-26 00:34:21,665 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:34:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -998649974, now seen corresponding path program 1 times [2022-11-26 00:34:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:21,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765139870] [2022-11-26 00:34:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:21,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:21,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:21,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765139870] [2022-11-26 00:34:21,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765139870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:21,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13995305] [2022-11-26 00:34:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:21,983 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:22,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-26 00:34:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:34:22,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:22,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:22,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-26 00:34:22,652 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 24 treesize of output 12 [2022-11-26 00:34:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:22,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:22,906 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 312 treesize of output 272 [2022-11-26 00:34:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:34:23,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13995305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:23,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [588693707] [2022-11-26 00:34:23,236 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-11-26 00:34:23,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-26 00:34:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752945103] [2022-11-26 00:34:23,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:34:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:34:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:34:23,239 INFO L87 Difference]: Start difference. First operand 1230 states and 4311 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:24,070 INFO L93 Difference]: Finished difference Result 1542 states and 4858 transitions. [2022-11-26 00:34:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:34:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:34:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:24,076 INFO L225 Difference]: With dead ends: 1542 [2022-11-26 00:34:24,076 INFO L226 Difference]: Without dead ends: 1542 [2022-11-26 00:34:24,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:34:24,077 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:24,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:34:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-11-26 00:34:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1050. [2022-11-26 00:34:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1003 states have (on average 3.6390827517447657) internal successors, (3650), 1049 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3650 transitions. [2022-11-26 00:34:24,107 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 3650 transitions. Word has length 10 [2022-11-26 00:34:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:24,108 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 3650 transitions. [2022-11-26 00:34:24,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:34:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 3650 transitions. [2022-11-26 00:34:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:34:24,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:24,109 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:24,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:24,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:24,315 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:34:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1071813561, now seen corresponding path program 3 times [2022-11-26 00:34:24,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:24,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782457437] [2022-11-26 00:34:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:25,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782457437] [2022-11-26 00:34:25,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782457437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:25,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893722341] [2022-11-26 00:34:25,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:34:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:25,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:25,065 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:25,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-26 00:34:25,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:34:25,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:34:25,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:34:25,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:25,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:34:25,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:25,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:34:25,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:25,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:34:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:26,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:29,583 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse6 (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1190) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 .cse4)) (.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse7 .cse8 2147483648) 0) (< (+ .cse8 2147483648) 0) (< 2147483647 (+ .cse7 .cse8)) (< 2147483647 .cse8) (< (select .cse9 .cse3) 4294967296)))))) (.cse5 (not (< 2 c_~N~0)))) (and (or (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1190) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (select .cse2 .cse4))) (or (< (+ .cse0 .cse1 2147483648) 0) (< 2147483647 .cse1) (< 0 (+ .cse0 1)) (< (select .cse2 .cse3) 4294967296))))) .cse5) (or (<= c_~N~0 2) .cse6) (or .cse6 .cse5)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-26 00:34:29,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,637 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 512 treesize of output 297 [2022-11-26 00:34:29,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,681 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 1623 treesize of output 1491 [2022-11-26 00:34:29,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1457 treesize of output 1417 [2022-11-26 00:34:29,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1417 treesize of output 1337 [2022-11-26 00:34:29,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1337 treesize of output 1305 [2022-11-26 00:34:29,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1305 treesize of output 1265 [2022-11-26 00:34:29,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1265 treesize of output 1245 [2022-11-26 00:34:29,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:29,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1245 treesize of output 1181 [2022-11-26 00:34:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-26 00:34:31,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893722341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:34:31,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [774506649] [2022-11-26 00:34:31,095 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-11-26 00:34:31,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:34:31,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 00:34:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959251318] [2022-11-26 00:34:31,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:34:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:34:31,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=518, Unknown=7, NotChecked=46, Total=650 [2022-11-26 00:34:31,096 INFO L87 Difference]: Start difference. First operand 1050 states and 3650 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:34:42,780 WARN L233 SmtUtils]: Spent 9.36s on a formula simplification. DAG size of input: 176 DAG size of output: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:34:56,569 WARN L233 SmtUtils]: Spent 13.16s on a formula simplification. DAG size of input: 172 DAG size of output: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:10,108 WARN L233 SmtUtils]: Spent 13.17s on a formula simplification. DAG size of input: 143 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:17,378 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 164 DAG size of output: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:23,705 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 146 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:34,613 WARN L233 SmtUtils]: Spent 9.14s on a formula simplification. DAG size of input: 148 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:35:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:37,585 INFO L93 Difference]: Finished difference Result 2362 states and 7598 transitions. [2022-11-26 00:35:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:35:37,586 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-26 00:35:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:37,591 INFO L225 Difference]: With dead ends: 2362 [2022-11-26 00:35:37,591 INFO L226 Difference]: Without dead ends: 2362 [2022-11-26 00:35:37,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=456, Invalid=2621, Unknown=7, NotChecked=108, Total=3192 [2022-11-26 00:35:37,593 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1434 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 75 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:37,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 0 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2234 Invalid, 2 Unknown, 184 Unchecked, 4.0s Time] [2022-11-26 00:35:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-11-26 00:35:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1310. [2022-11-26 00:35:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1263 states have (on average 4.3056215360253365) internal successors, (5438), 1309 states have internal predecessors, (5438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:35:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 5438 transitions. [2022-11-26 00:35:37,629 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 5438 transitions. Word has length 11 [2022-11-26 00:35:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:37,630 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 5438 transitions. [2022-11-26 00:35:37,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:35:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 5438 transitions. [2022-11-26 00:35:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:35:37,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:35:37,631 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:37,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-26 00:35:37,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-26 00:35:37,838 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:35:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:35:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1071813479, now seen corresponding path program 3 times [2022-11-26 00:35:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:35:37,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504305036] [2022-11-26 00:35:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:35:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:35:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:35:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:35:38,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:35:38,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504305036] [2022-11-26 00:35:38,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504305036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:35:38,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532801701] [2022-11-26 00:35:38,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:35:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:35:38,679 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:35:38,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-26 00:35:39,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:35:39,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:35:39,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:35:39,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:35:39,165 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 16 treesize of output 12 [2022-11-26 00:35:39,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-11-26 00:35:39,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:39,338 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 21 treesize of output 23 [2022-11-26 00:35:39,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:35:39,455 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 21 treesize of output 23 [2022-11-26 00:35:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:35:40,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:42,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:42,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 114 [2022-11-26 00:35:42,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:42,639 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 304 treesize of output 294 [2022-11-26 00:35:42,652 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:42,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 259 treesize of output 219 [2022-11-26 00:35:42,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:35:42,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 151 [2022-11-26 00:35:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:35:43,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532801701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:35:43,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [445066729] [2022-11-26 00:35:43,537 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-11-26 00:35:43,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:35:43,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 00:35:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384555056] [2022-11-26 00:35:43,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:35:43,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:35:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:43,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:35:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=554, Unknown=2, NotChecked=0, Total=650 [2022-11-26 00:35:43,539 INFO L87 Difference]: Start difference. First operand 1310 states and 5438 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:36:08,405 WARN L233 SmtUtils]: Spent 22.47s on a formula simplification. DAG size of input: 113 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:36:31,609 WARN L233 SmtUtils]: Spent 22.47s on a formula simplification. DAG size of input: 115 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:36:50,434 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:36:57,162 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 150 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:10,320 WARN L233 SmtUtils]: Spent 12.36s on a formula simplification. DAG size of input: 93 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:25,099 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 126 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:40,558 WARN L233 SmtUtils]: Spent 14.46s on a formula simplification. DAG size of input: 142 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:37:55,393 WARN L233 SmtUtils]: Spent 14.51s on a formula simplification. DAG size of input: 96 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:38:11,359 WARN L233 SmtUtils]: Spent 14.59s on a formula simplification. DAG size of input: 134 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:38:19,138 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 104 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:38:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:38:21,487 INFO L93 Difference]: Finished difference Result 2698 states and 8852 transitions. [2022-11-26 00:38:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-26 00:38:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-26 00:38:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:38:21,496 INFO L225 Difference]: With dead ends: 2698 [2022-11-26 00:38:21,496 INFO L226 Difference]: Without dead ends: 2698 [2022-11-26 00:38:21,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 155.1s TimeCoverageRelationStatistics Valid=1064, Invalid=4190, Unknown=2, NotChecked=0, Total=5256 [2022-11-26 00:38:21,498 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2063 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:38:21,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 0 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-26 00:38:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2022-11-26 00:38:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 1310. [2022-11-26 00:38:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1263 states have (on average 4.134600158353128) internal successors, (5222), 1309 states have internal predecessors, (5222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 5222 transitions. [2022-11-26 00:38:21,538 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 5222 transitions. Word has length 11 [2022-11-26 00:38:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:38:21,539 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 5222 transitions. [2022-11-26 00:38:21,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:38:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 5222 transitions. [2022-11-26 00:38:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:38:21,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:38:21,540 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:38:21,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-11-26 00:38:21,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:21,746 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:38:21,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:38:21,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1071813473, now seen corresponding path program 1 times [2022-11-26 00:38:21,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:38:21,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73364854] [2022-11-26 00:38:21,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:38:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:22,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:38:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73364854] [2022-11-26 00:38:22,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73364854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:38:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627399007] [2022-11-26 00:38:22,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:38:22,843 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:38:22,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-26 00:38:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:23,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 00:38:23,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:38:23,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:38:23,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:23,400 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 25 treesize of output 24 [2022-11-26 00:38:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:23,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 16 treesize of output 18 [2022-11-26 00:38:23,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:23,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:38:24,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:24,528 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 450 treesize of output 390 [2022-11-26 00:38:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:24,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:38:26,725 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse8 4)) (.cse3 (+ c_~A~0.offset .cse8))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 .cse3))) (or (not (<= 0 (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse0 c_~bag2~0 .cse1) 2147483647)) (not (<= .cse0 4294967295)) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= .cse1 2147483647) (< (+ .cse0 9223372039002259455) 0))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse3)) (.cse6 (select .cse7 .cse4))) (or (not (<= (+ .cse5 c_~bag2~0) 2147483647)) (not (<= .cse6 4294967295)) (not (<= (+ .cse5 .cse6) 2147483647)) (not (<= 0 (+ .cse5 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (<= .cse6 2147483647))))))))) is different from false [2022-11-26 00:38:26,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse0 2147483647) (not (<= (+ .cse0 .cse1) 2147483647)) (not (<= 0 (+ .cse1 2147483648))))))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse6 .cse3)) (.cse5 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse4 .cse5)) (<= .cse4 2147483647) (< (+ .cse5 2147483648) 0))))))) is different from false [2022-11-26 00:38:26,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse5 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1276 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse4 .cse5 v_ArrVal_1276)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (<= .cse1 2147483647) (< 2147483647 (+ .cse1 .cse0)))))) (forall ((v_ArrVal_1276 Int) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse4 .cse5 v_ArrVal_1276)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse8 .cse3)) (.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= .cse6 2147483647) (not (<= (+ .cse6 .cse7) 2147483647)) (not (<= 0 (+ .cse7 2147483648))))))))) is different from false [2022-11-26 00:38:26,938 INFO L321 Elim1Store]: treesize reduction 58, result has 45.8 percent of original size [2022-11-26 00:38:26,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 271 treesize of output 177 [2022-11-26 00:38:26,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 504 [2022-11-26 00:38:26,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:26,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 653 treesize of output 637 [2022-11-26 00:38:27,002 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 603 treesize of output 579 [2022-11-26 00:38:27,015 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 579 treesize of output 567 [2022-11-26 00:38:27,027 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 567 treesize of output 543 [2022-11-26 00:38:27,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:27,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 585 treesize of output 563 [2022-11-26 00:38:27,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:27,077 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 519 treesize of output 471 [2022-11-26 00:38:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:38:27,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627399007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:38:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980697305] [2022-11-26 00:38:27,471 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-11-26 00:38:27,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:38:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-26 00:38:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655228095] [2022-11-26 00:38:27,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:38:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 00:38:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:38:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 00:38:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=395, Unknown=3, NotChecked=126, Total=600 [2022-11-26 00:38:27,472 INFO L87 Difference]: Start difference. First operand 1310 states and 5222 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:38:29,530 INFO L93 Difference]: Finished difference Result 1674 states and 6024 transitions. [2022-11-26 00:38:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:38:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 11 [2022-11-26 00:38:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:38:29,555 INFO L225 Difference]: With dead ends: 1674 [2022-11-26 00:38:29,556 INFO L226 Difference]: Without dead ends: 1674 [2022-11-26 00:38:29,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=212, Invalid=919, Unknown=3, NotChecked=198, Total=1332 [2022-11-26 00:38:29,557 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 374 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:38:29,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 0 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 720 Invalid, 0 Unknown, 267 Unchecked, 1.0s Time] [2022-11-26 00:38:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2022-11-26 00:38:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1326. [2022-11-26 00:38:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1279 states have (on average 4.075840500390931) internal successors, (5213), 1325 states have internal predecessors, (5213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 5213 transitions. [2022-11-26 00:38:29,577 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 5213 transitions. Word has length 11 [2022-11-26 00:38:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:38:29,577 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 5213 transitions. [2022-11-26 00:38:29,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 5213 transitions. [2022-11-26 00:38:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:38:29,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:38:29,578 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:38:29,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-11-26 00:38:29,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-26 00:38:29,784 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:38:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:38:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1071813582, now seen corresponding path program 2 times [2022-11-26 00:38:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:38:29,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970857868] [2022-11-26 00:38:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:38:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:30,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:38:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970857868] [2022-11-26 00:38:30,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970857868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:38:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936584249] [2022-11-26 00:38:30,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:38:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:30,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:38:30,439 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:38:30,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-26 00:38:30,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:38:30,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:38:30,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:38:30,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:38:30,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:38:31,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:31,097 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 20 treesize of output 22 [2022-11-26 00:38:31,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:38:31,195 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 20 treesize of output 22 [2022-11-26 00:38:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:32,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:38:35,140 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~j~0 4)) (.cse20 (+ 2 c_~j~0))) (let ((.cse0 (not (< .cse20 c_~N~0))) (.cse3 (+ c_~A~0.offset 8 .cse21)) (.cse5 (+ c_~A~0.offset .cse21 4)) (.cse6 (+ c_~A~0.offset .cse21))) (and (or .cse0 (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse6)) (.cse4 (select .cse2 .cse5))) (or (< (+ 9223372039002259455 .cse1) 0) (not (<= (+ c_~bag2~0 .cse1) 2147483647)) (< 0 (+ (select .cse2 .cse3) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse1 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse1 .cse4)) (< 4294967295 .cse1) (< (+ c_~bag2~0 .cse1 .cse4 2147483648) 0)))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (let ((.cse16 (<= c_~N~0 .cse20))) (and (or .cse0 (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) c_~A~0.base))) (let ((.cse9 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse6))) (or (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (< 0 (+ (select .cse8 .cse3) 9223372039002259456)) (<= .cse7 0) (< c_~bag2~0 (+ .cse9 1)) (< (+ .cse7 .cse9 2147483648) 0) (not (<= .cse7 4294967295))))))) (or .cse0 (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse6)) (.cse12 (select .cse11 .cse5))) (or (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (< 0 (+ (select .cse11 .cse3) 9223372039002259456)) (< c_~bag2~0 (+ .cse12 1)) (not (<= .cse10 0)) (< (+ .cse10 .cse12 2147483648) 0)))))) (or (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse6)) (.cse15 (select .cse14 .cse5))) (or (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (< 0 (+ (select .cse14 .cse3) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse13 2147483648))) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse13)) (< 2147483647 (+ .cse13 .cse15)) (<= .cse13 0) (< (+ .cse13 .cse15 2147483648) 0))))) .cse16) (or (forall ((v_ArrVal_1320 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse6)) (.cse19 (select .cse18 .cse5))) (or (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (< 0 (+ (select .cse18 .cse3) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (< 2147483647 (+ .cse17 .cse19)) (< (+ c_~bag2~0 c_~sum2~0 .cse17 2147483648) 0) (not (<= .cse17 0)) (< (+ .cse17 .cse19 2147483648) 0) (< 4294967295 .cse19))))) .cse16))))))) is different from false [2022-11-26 00:38:35,503 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 (not (< 2 c_~N~0))) (.cse6 (<= c_~N~0 2)) (.cse4 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5))) (or (< 2147483647 .cse1) (< (+ .cse1 2147483648 .cse2) 0) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)) (<= .cse1 0) (< 0 (+ .cse2 1))))))) (or .cse6 (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse9 .cse5)) (.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse7 .cse8)) (< 2147483647 .cse7) (< (+ .cse7 2147483648 .cse8) 0) (< 0 (+ (select .cse9 .cse4) 9223372039002259456)) (<= .cse7 0)))))) (or (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (select .cse12 .cse5))) (or (< 0 .cse10) (< (+ .cse10 2147483648 .cse11) 0) (< 0 (+ (select .cse12 .cse4) 9223372039002259456)) (< 0 (+ .cse11 1)))))) .cse0) (or (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) |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 .cse5))) (or (< 2147483647 (+ .cse13 .cse14)) (< 2147483647 .cse13) (< (+ .cse13 2147483648) 0) (< (+ .cse13 2147483648 .cse14) 0) (< 0 (+ (select .cse15 .cse4) 9223372039002259456)))))) .cse0) (or .cse6 (forall ((v_ArrVal_1320 (Array Int Int)) (v_ArrVal_1319 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1319) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1320) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (select .cse18 .cse5))) (or (< 2147483647 (+ .cse16 .cse17)) (< (+ .cse16 2147483648) 0) (< 0 .cse16) (< (+ .cse16 2147483648 .cse17) 0) (< 0 (+ (select .cse18 .cse4) 9223372039002259456)))))))))) is different from false [2022-11-26 00:38:35,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,555 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 869 treesize of output 498 [2022-11-26 00:38:35,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,606 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 3152 treesize of output 2884 [2022-11-26 00:38:35,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2848 treesize of output 2816 [2022-11-26 00:38:35,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2816 treesize of output 2800 [2022-11-26 00:38:35,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2800 treesize of output 2760 [2022-11-26 00:38:35,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2760 treesize of output 2680 [2022-11-26 00:38:35,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:35,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2680 treesize of output 2640 [2022-11-26 00:38:36,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:36,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2640 treesize of output 2560 [2022-11-26 00:38:36,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:36,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2560 treesize of output 2520 [2022-11-26 00:38:36,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:36,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2520 treesize of output 2484 [2022-11-26 00:38:36,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:36,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2484 treesize of output 2412 [2022-11-26 00:38:36,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:38:36,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2412 treesize of output 2332 [2022-11-26 00:38:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-26 00:38:38,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936584249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:38:38,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430755159] [2022-11-26 00:38:38,603 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-11-26 00:38:38,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:38:38,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 00:38:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360625010] [2022-11-26 00:38:38,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:38:38,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:38:38,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:38:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:38:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=483, Unknown=2, NotChecked=90, Total=650 [2022-11-26 00:38:38,605 INFO L87 Difference]: Start difference. First operand 1326 states and 5213 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:38:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:38:48,534 INFO L93 Difference]: Finished difference Result 1942 states and 6173 transitions. [2022-11-26 00:38:48,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-26 00:38:48,535 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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 11 [2022-11-26 00:38:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:38:48,539 INFO L225 Difference]: With dead ends: 1942 [2022-11-26 00:38:48,539 INFO L226 Difference]: Without dead ends: 1942 [2022-11-26 00:38:48,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=385, Invalid=2273, Unknown=2, NotChecked=202, Total=2862 [2022-11-26 00:38:48,540 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1347 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:38:48,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 0 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1904 Invalid, 0 Unknown, 306 Unchecked, 3.1s Time] [2022-11-26 00:38:48,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2022-11-26 00:38:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1326. [2022-11-26 00:38:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1279 states have (on average 3.8944487881157155) internal successors, (4981), 1325 states have internal predecessors, (4981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 4981 transitions. [2022-11-26 00:38:48,578 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 4981 transitions. Word has length 11 [2022-11-26 00:38:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:38:48,578 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 4981 transitions. [2022-11-26 00:38:48,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 00:38:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 4981 transitions. [2022-11-26 00:38:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:38:48,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:38:48,580 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:38:48,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-26 00:38:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-26 00:38:48,787 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:38:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:38:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 700183991, now seen corresponding path program 1 times [2022-11-26 00:38:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:38:48,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709027713] [2022-11-26 00:38:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:38:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:38:48,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:38:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709027713] [2022-11-26 00:38:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709027713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:38:48,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:38:48,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:38:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696016453] [2022-11-26 00:38:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:38:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:38:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:38:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:38:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:38:48,882 INFO L87 Difference]: Start difference. First operand 1326 states and 4981 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:38:48,955 INFO L93 Difference]: Finished difference Result 1248 states and 4531 transitions. [2022-11-26 00:38:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:38:48,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:38:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:38:48,959 INFO L225 Difference]: With dead ends: 1248 [2022-11-26 00:38:48,960 INFO L226 Difference]: Without dead ends: 1248 [2022-11-26 00:38:48,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:38:48,960 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:38:48,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:38:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-11-26 00:38:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-11-26 00:38:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1209 states have (on average 3.747725392886683) internal successors, (4531), 1247 states have internal predecessors, (4531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 4531 transitions. [2022-11-26 00:38:48,993 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 4531 transitions. Word has length 12 [2022-11-26 00:38:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:38:48,993 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 4531 transitions. [2022-11-26 00:38:48,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 4531 transitions. [2022-11-26 00:38:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:38:48,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:38:48,995 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:38:48,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-26 00:38:48,995 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:38:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:38:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1133524006, now seen corresponding path program 2 times [2022-11-26 00:38:48,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:38:48,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844857837] [2022-11-26 00:38:48,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:38:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:49,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:38:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844857837] [2022-11-26 00:38:49,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844857837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:38:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109912752] [2022-11-26 00:38:49,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:38:49,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:38:49,603 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:38:49,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-26 00:38:50,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:38:50,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:38:50,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:38:50,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:38:51,587 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-26 00:38:51,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 599 treesize of output 483 [2022-11-26 00:38:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:52,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:38:54,621 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-26 00:38:54,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1011 treesize of output 697 [2022-11-26 00:38:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:55,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109912752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:38:55,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1633255419] [2022-11-26 00:38:55,395 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-11-26 00:38:55,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:38:55,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 00:38:55,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427327095] [2022-11-26 00:38:55,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:38:55,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 00:38:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:38:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 00:38:55,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:38:55,398 INFO L87 Difference]: Start difference. First operand 1248 states and 4531 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:38:58,816 INFO L93 Difference]: Finished difference Result 1408 states and 4225 transitions. [2022-11-26 00:38:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-26 00:38:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:38:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:38:58,820 INFO L225 Difference]: With dead ends: 1408 [2022-11-26 00:38:58,820 INFO L226 Difference]: Without dead ends: 1384 [2022-11-26 00:38:58,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=745, Invalid=2335, Unknown=0, NotChecked=0, Total=3080 [2022-11-26 00:38:58,821 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 939 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:38:58,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 0 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-26 00:38:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2022-11-26 00:38:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 880. [2022-11-26 00:38:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 841 states have (on average 3.4887039239001187) internal successors, (2934), 879 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2934 transitions. [2022-11-26 00:38:58,837 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2934 transitions. Word has length 12 [2022-11-26 00:38:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:38:58,838 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 2934 transitions. [2022-11-26 00:38:58,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:38:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2934 transitions. [2022-11-26 00:38:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:38:58,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:38:58,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:38:58,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-26 00:38:59,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:59,039 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:38:59,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:38:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1880951009, now seen corresponding path program 1 times [2022-11-26 00:38:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:38:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676434673] [2022-11-26 00:38:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:38:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:59,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:38:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676434673] [2022-11-26 00:38:59,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676434673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:38:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910844184] [2022-11-26 00:38:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:38:59,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:38:59,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:38:59,288 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:38:59,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-26 00:38:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:38:59,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:38:59,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:38:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:38:59,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:38:59,943 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 12 treesize of output 4 [2022-11-26 00:39:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:00,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910844184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:00,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324651346] [2022-11-26 00:39:00,083 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-11-26 00:39:00,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:00,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-26 00:39:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14685230] [2022-11-26 00:39:00,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:00,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:39:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:39:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:39:00,084 INFO L87 Difference]: Start difference. First operand 880 states and 2934 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:00,624 INFO L93 Difference]: Finished difference Result 926 states and 2890 transitions. [2022-11-26 00:39:00,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:39:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:39:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:00,626 INFO L225 Difference]: With dead ends: 926 [2022-11-26 00:39:00,626 INFO L226 Difference]: Without dead ends: 729 [2022-11-26 00:39:00,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:39:00,627 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:00,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:39:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-26 00:39:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2022-11-26 00:39:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 690 states have (on average 3.482608695652174) internal successors, (2403), 728 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2403 transitions. [2022-11-26 00:39:00,638 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2403 transitions. Word has length 12 [2022-11-26 00:39:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:00,638 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 2403 transitions. [2022-11-26 00:39:00,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2403 transitions. [2022-11-26 00:39:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:39:00,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:00,639 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:00,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:00,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:00,843 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:39:00,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:00,843 INFO L85 PathProgramCache]: Analyzing trace with hash 230869834, now seen corresponding path program 4 times [2022-11-26 00:39:00,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:00,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856713442] [2022-11-26 00:39:00,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:01,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:01,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856713442] [2022-11-26 00:39:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856713442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:01,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229475446] [2022-11-26 00:39:01,706 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:39:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:01,711 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:01,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-26 00:39:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:02,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 00:39:02,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:02,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:39:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:02,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:39:02,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:39:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:04,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:10,153 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse50 (* c_~j~0 4))) (let ((.cse4 (+ c_~A~0.offset 12 .cse50)) (.cse6 (+ c_~A~0.offset .cse50)) (.cse7 (+ c_~A~0.offset 8 .cse50)) (.cse5 (+ c_~A~0.offset .cse50 4))) (and (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse7)) (.cse2 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5))) (or (< c_~bag2~0 (+ .cse0 .cse1 1)) (not (<= 0 (+ .cse2 .cse0 .cse1 2147483648))) (not (<= 0 (+ .cse2 .cse1 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)) (not (<= .cse2 4294967295)) (< (select .cse3 .cse4) 4294967296) (<= .cse2 0) (< c_~bag2~0 (+ .cse1 1)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse7)) (.cse8 (select .cse11 .cse6)) (.cse9 (select .cse11 .cse5))) (or (< 2147483647 (+ .cse8 c_~bag2~0 c_~sum2~0 .cse9)) (< 2147483647 (+ .cse8 .cse10 .cse9)) (< (+ .cse8 .cse10 .cse9 2147483648) 0) (not (<= 0 (+ .cse8 .cse9 2147483648))) (not (<= (+ .cse8 c_~bag2~0) 2147483647)) (< (+ .cse8 c_~bag2~0 c_~sum2~0 .cse9 2147483648) 0) (not (<= .cse8 4294967295)) (< (select .cse11 .cse4) 4294967296) (<= .cse8 0) (< c_~bag2~0 (+ .cse9 1)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6))) (let ((.cse14 (+ .cse15 c_~bag2~0)) (.cse13 (select .cse16 .cse7)) (.cse12 (select .cse16 .cse5))) (or (not (<= .cse12 4294967295)) (not (<= 0 (+ .cse13 .cse12 2147483648))) (not (<= .cse14 2147483647)) (< .cse15 (+ .cse13 1)) (< (select .cse16 .cse4) 4294967296) (< .cse14 (+ .cse13 .cse12 1)) (not (<= (+ .cse15 .cse12) 2147483647)) (not (<= .cse15 0)) (not (<= 0 (+ .cse15 c_~bag2~0 c_~sum2~0 2147483648)))))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse7)) (.cse18 (select .cse20 .cse5)) (.cse17 (select .cse20 .cse6))) (or (< 2147483647 (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18)) (< 2147483647 (+ .cse17 .cse19 .cse18)) (< (+ .cse17 .cse19 .cse18 2147483648) 0) (not (<= 0 (+ .cse17 .cse18 2147483648))) (not (<= (+ .cse17 c_~bag2~0) 2147483647)) (< (+ .cse17 c_~bag2~0 c_~sum2~0 .cse18 2147483648) 0) (< (select .cse20 .cse4) 4294967296) (< c_~bag2~0 (+ .cse18 1)) (not (<= .cse17 0)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse21 (select .cse24 .cse7)) (.cse22 (select .cse24 .cse5)) (.cse23 (select .cse24 .cse6))) (or (< c_~bag2~0 (+ .cse21 .cse22 1)) (not (<= 0 (+ .cse23 .cse21 .cse22 2147483648))) (not (<= 0 (+ .cse23 .cse22 2147483648))) (not (<= (+ .cse23 c_~bag2~0) 2147483647)) (< (select .cse24 .cse4) 4294967296) (< c_~bag2~0 (+ .cse22 1)) (not (<= .cse23 0)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse6))) (let ((.cse27 (+ .cse28 c_~bag2~0)) (.cse25 (select .cse29 .cse7)) (.cse26 (select .cse29 .cse5))) (or (not (<= 0 (+ .cse25 .cse26 2147483648))) (not (<= .cse27 2147483647)) (< .cse28 (+ .cse25 1)) (< (select .cse29 .cse4) 4294967296) (<= .cse28 0) (< .cse27 (+ .cse25 .cse26 1)) (not (<= (+ .cse28 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse28 .cse26) 2147483647))))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse30 (select .cse33 .cse6)) (.cse32 (select .cse33 .cse7)) (.cse31 (select .cse33 .cse5))) (or (not (<= 0 (+ .cse30 c_~bag2~0 c_~sum2~0 .cse31 2147483648))) (not (<= 0 (+ .cse32 .cse31 2147483648))) (not (<= 0 (+ .cse30 .cse31 2147483648))) (not (<= (+ .cse30 c_~bag2~0) 2147483647)) (not (<= (+ .cse30 c_~bag2~0 c_~sum2~0 .cse31) 2147483647)) (< (select .cse33 .cse4) 4294967296) (<= .cse30 0) (not (<= .cse32 4294967295)) (not (<= (+ .cse30 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= (+ .cse30 .cse31) 2147483647)) (not (<= 0 (+ .cse30 c_~bag2~0 2147483648))) (not (<= (+ .cse32 .cse31) 2147483647)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse34 (select .cse37 .cse6)) (.cse36 (select .cse37 .cse7)) (.cse35 (select .cse37 .cse5))) (or (not (<= 0 (+ .cse34 c_~bag2~0 c_~sum2~0 .cse35 2147483648))) (not (<= 0 (+ .cse36 .cse35 2147483648))) (not (<= 0 (+ .cse34 .cse35 2147483648))) (not (<= (+ .cse34 c_~bag2~0) 2147483647)) (not (<= (+ .cse34 c_~bag2~0 c_~sum2~0 .cse35) 2147483647)) (< (select .cse37 .cse4) 4294967296) (not (<= (+ .cse34 .cse35) 2147483647)) (not (<= .cse34 0)) (not (<= 0 (+ .cse34 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse34 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse36 .cse35) 2147483647)))))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse38 (select .cse41 .cse6)) (.cse39 (select .cse41 .cse7)) (.cse40 (select .cse41 .cse5))) (or (not (<= (+ .cse38 c_~bag2~0 .cse39 .cse40) 2147483647)) (not (<= (+ .cse38 c_~bag2~0) 2147483647)) (not (<= (+ .cse38 c_~bag2~0 .cse40) 2147483647)) (< (+ 9223372039002259455 .cse38) 0) (not (<= .cse38 4294967295)) (< (select .cse41 .cse4) 4294967296) (not (<= 0 (+ .cse38 c_~bag2~0 .cse40 2147483648))) (not (<= 0 (+ .cse38 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse38 c_~bag2~0 .cse39 .cse40 2147483648))))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse6)) (.cse43 (select .cse45 .cse7)) (.cse42 (select .cse45 .cse5))) (or (< .cse42 1) (not (<= 0 (+ .cse43 .cse42 2147483648))) (not (<= (+ .cse44 c_~bag2~0 c_~sum2~0 .cse42) 2147483647)) (not (<= (+ .cse44 c_~bag2~0 .cse42) 2147483647)) (< (+ 9223372039002259455 .cse44) 0) (not (<= .cse44 4294967295)) (< (select .cse45 .cse4) 4294967296) (not (<= 0 (+ .cse44 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse44 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse43 .cse42) 2147483647)))))) (forall ((v_ArrVal_1455 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) c_~A~0.base))) (let ((.cse46 (select .cse49 .cse5)) (.cse47 (select .cse49 .cse7)) (.cse48 (select .cse49 .cse6))) (or (< .cse46 1) (not (<= 0 (+ .cse47 .cse46 2147483648))) (not (<= (+ .cse48 c_~bag2~0 .cse46) 2147483647)) (< (+ 9223372039002259455 .cse48) 0) (not (<= .cse48 4294967295)) (< (select .cse49 .cse4) 4294967296) (< (+ .cse48 c_~bag2~0) (+ .cse47 1)) (not (<= (+ .cse48 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse48 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse48 c_~bag2~0 c_~sum2~0 2147483648)))))))))) is different from false [2022-11-26 00:39:11,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 .cse1 2147483648) 0) (< 0 (+ .cse2 .cse1 1)) (< (+ .cse0 .cse2 .cse1 2147483648) 0) (< 0 (+ .cse1 1)) (< 0 .cse0) (< (select .cse3 .cse4) 4294967296))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (select .cse10 .cse6)) (.cse8 (select .cse10 .cse5))) (or (< 2147483647 (+ .cse7 .cse8)) (< (+ .cse9 .cse8 2147483648) 0) (< .cse8 1) (< (select .cse10 .cse4) 4294967296) (< (+ .cse7 2147483648) 0) (< 2147483647 (+ .cse9 .cse8)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (select .cse14 .cse6)) (.cse12 (select .cse14 .cse5))) (or (< 2147483647 (+ .cse11 .cse12)) (< (+ .cse13 .cse12 2147483648) 0) (<= .cse11 0) (< (+ .cse11 .cse12 2147483648) 0) (< 2147483647 .cse11) (< 4294967295 .cse13) (< (select .cse14 .cse4) 4294967296) (< 2147483647 (+ .cse13 .cse12)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (select .cse18 .cse6)) (.cse16 (select .cse18 .cse5))) (or (<= .cse15 0) (< (+ .cse15 .cse16 2147483648) 0) (< 2147483647 .cse15) (< 0 (+ .cse17 .cse16 1)) (< (+ .cse15 .cse17 .cse16 2147483648) 0) (< 0 (+ .cse16 1)) (< (select .cse18 .cse4) 4294967296))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse22 .cse5)) (.cse19 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (select .cse22 .cse6))) (or (< 2147483647 (+ .cse19 .cse20)) (< (+ .cse21 .cse20 2147483648) 0) (< .cse19 (+ .cse21 .cse20 1)) (< 0 .cse19) (< (select .cse22 .cse4) 4294967296) (< .cse19 (+ .cse21 1)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse26 .cse5)) (.cse23 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse25 (select .cse26 .cse6))) (or (< 2147483647 (+ .cse23 .cse24)) (< (+ .cse25 .cse24 2147483648) 0) (< .cse24 1) (< (select .cse26 .cse4) 4294967296) (< (+ .cse23 2147483648) 0) (< .cse23 (+ .cse25 1)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse30 .cse5)) (.cse27 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse30 .cse6))) (or (not (<= (+ .cse27 .cse28) 2147483647)) (<= .cse27 0) (< .cse27 (+ .cse29 .cse28 1)) (< (select .cse30 .cse4) 4294967296) (not (<= 0 (+ .cse29 .cse28 2147483648))) (not (<= .cse27 2147483647)) (< .cse27 (+ .cse29 1)))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (select .cse34 .cse6)) (.cse32 (select .cse34 .cse5))) (or (<= .cse31 0) (< (+ .cse31 .cse32 2147483648) 0) (< 2147483647 .cse31) (< 2147483647 (+ .cse31 .cse33 .cse32)) (< (+ .cse31 .cse33 .cse32 2147483648) 0) (< 0 (+ .cse32 1)) (< (select .cse34 .cse4) 4294967296))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (select .cse38 .cse6)) (.cse36 (select .cse38 .cse5)) (.cse35 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse35 .cse36)) (< (+ .cse35 .cse36 2147483648) 0) (< 2147483647 .cse35) (< 2147483647 (+ .cse35 .cse37 .cse36)) (< (+ .cse35 .cse37 .cse36 2147483648) 0) (< (select .cse38 .cse4) 4294967296) (< (+ .cse35 2147483648) 0))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse42 .cse6)) (.cse40 (select .cse42 .cse5)) (.cse39 (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse39 .cse40 2147483648) 0) (< 2147483647 (+ .cse39 .cse41 .cse40)) (< (+ .cse39 .cse41 .cse40 2147483648) 0) (< 0 (+ .cse40 1)) (< 0 .cse39) (< (select .cse42 .cse4) 4294967296))))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse45 (select .cse46 .cse6)) (.cse44 (select .cse46 .cse5))) (or (< 2147483647 (+ .cse43 .cse44)) (< (+ .cse45 .cse44 2147483648) 0) (< (+ .cse43 .cse44 2147483648) 0) (< 0 .cse43) (< (select .cse46 .cse4) 4294967296) (< (+ .cse43 2147483648) 0) (< 2147483647 (+ .cse45 .cse44)))))))) is different from false [2022-11-26 00:39:11,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,185 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 3172 treesize of output 1733 [2022-11-26 00:39:11,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6578 treesize of output 5846 [2022-11-26 00:39:11,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5802 treesize of output 5730 [2022-11-26 00:39:11,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5730 treesize of output 5694 [2022-11-26 00:39:11,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5694 treesize of output 5618 [2022-11-26 00:39:11,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5618 treesize of output 5546 [2022-11-26 00:39:11,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:11,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5546 treesize of output 5508 [2022-11-26 00:39:12,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5508 treesize of output 5448 [2022-11-26 00:39:12,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5448 treesize of output 5418 [2022-11-26 00:39:12,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5418 treesize of output 5350 [2022-11-26 00:39:12,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5350 treesize of output 5270 [2022-11-26 00:39:12,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5270 treesize of output 5230 [2022-11-26 00:39:12,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5230 treesize of output 5158 [2022-11-26 00:39:12,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5158 treesize of output 5122 [2022-11-26 00:39:12,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:12,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5122 treesize of output 5042 [2022-11-26 00:39:13,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5042 treesize of output 4882 [2022-11-26 00:39:13,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4882 treesize of output 4730 [2022-11-26 00:39:13,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4730 treesize of output 4654 [2022-11-26 00:39:13,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4654 treesize of output 4618 [2022-11-26 00:39:13,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4618 treesize of output 4584 [2022-11-26 00:39:13,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4584 treesize of output 4520 [2022-11-26 00:39:13,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4520 treesize of output 4488 [2022-11-26 00:39:13,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4488 treesize of output 4416 [2022-11-26 00:39:13,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:13,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4416 treesize of output 4380 [2022-11-26 00:39:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 00:39:18,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229475446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:18,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538505911] [2022-11-26 00:39:18,432 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-11-26 00:39:18,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:18,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:39:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708779551] [2022-11-26 00:39:18,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:18,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:39:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:39:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=795, Unknown=2, NotChecked=114, Total=992 [2022-11-26 00:39:18,434 INFO L87 Difference]: Start difference. First operand 729 states and 2403 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:29,579 INFO L93 Difference]: Finished difference Result 1109 states and 3401 transitions. [2022-11-26 00:39:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:39:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:39:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:29,582 INFO L225 Difference]: With dead ends: 1109 [2022-11-26 00:39:29,582 INFO L226 Difference]: Without dead ends: 1109 [2022-11-26 00:39:29,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=235, Invalid=2027, Unknown=2, NotChecked=186, Total=2450 [2022-11-26 00:39:29,583 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 723 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:29,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 0 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2746 Invalid, 0 Unknown, 339 Unchecked, 3.6s Time] [2022-11-26 00:39:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-26 00:39:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 777. [2022-11-26 00:39:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 738 states have (on average 3.7127371273712737) internal successors, (2740), 776 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 2740 transitions. [2022-11-26 00:39:29,603 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 2740 transitions. Word has length 13 [2022-11-26 00:39:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:29,604 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 2740 transitions. [2022-11-26 00:39:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 2740 transitions. [2022-11-26 00:39:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:39:29,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:29,605 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:29,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:29,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:29,812 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:39:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 230869916, now seen corresponding path program 4 times [2022-11-26 00:39:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:29,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136209815] [2022-11-26 00:39:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:30,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136209815] [2022-11-26 00:39:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136209815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772693896] [2022-11-26 00:39:30,740 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:39:30,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:30,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:30,741 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:30,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-26 00:39:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:39:31,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:31,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:39:31,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:31,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-26 00:39:31,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:31,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:39:31,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:31,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:39:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:34,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:37,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~j~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse14)) (.cse6 (+ c_~A~0.offset .cse14 4)) (.cse7 (+ c_~A~0.offset 12 .cse14)) (.cse8 (+ c_~A~0.offset 8 .cse14))) (and (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (forall ((v_ArrVal_1503 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse8)) (.cse3 (select .cse4 .cse7)) (.cse0 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (not (<= 0 (+ .cse0 .cse1 2147483648))) (not (<= 0 (+ c_~bag2~0 2147483648 .cse2))) (< .cse3 0) (<= 0 (+ .cse1 .cse3 2147483648)) (not (<= (+ .cse0 .cse2) 2147483647)) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse2))) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse0 2147483648 .cse2)))))))) (forall ((v_ArrVal_1503 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse8)) (.cse10 (select .cse13 .cse7)) (.cse11 (select .cse13 .cse6)) (.cse9 (select .cse13 .cse5))) (or (not (<= 0 (+ c_~bag2~0 2147483648 .cse9))) (< .cse10 0) (< 4294967295 .cse9) (< (+ .cse11 .cse12) (+ c_~bag2~0 .cse9 1)) (<= 0 (+ .cse12 .cse10 2147483648)) (not (<= 0 (+ 9223372039002259455 .cse9))) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648 .cse9))) (not (<= (+ .cse11 c_~bag2~0 .cse9) 2147483647)) (not (<= (+ .cse11 c_~bag2~0 c_~sum2~0 .cse9) 2147483647))))))))) is different from false [2022-11-26 00:39:37,500 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1502 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse4 .cse7)) (.cse2 (select .cse4 .cse6)) (.cse0 (select .cse4 .cse5)) (.cse3 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 0) (< (+ .cse1 .cse2) (+ .cse3 1)) (< 2147483647 (+ .cse3 .cse1)) (<= 0 (+ .cse2 2147483648 .cse0)) (< (+ .cse3 2147483648) 0))))) (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1502 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse12 .cse7)) (.cse11 (select .cse12 .cse6)) (.cse8 (select .cse12 .cse5)) (.cse9 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse8 0) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= 0 (+ .cse10 .cse11 2147483648))) (<= 0 (+ .cse11 2147483648 .cse8)) (not (<= 0 (+ .cse9 2147483648))))))))) is different from false [2022-11-26 00:39:37,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1500 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 .cse9 v_ArrVal_1500)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse4 .cse7)) (.cse1 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (< .cse0 0) (not (<= 0 (+ .cse1 2147483648))) (<= 0 (+ .cse2 2147483648 .cse0)) (not (<= (+ .cse3 .cse1) 2147483647)) (not (<= 0 (+ .cse3 .cse2 2147483648))))))) (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1500 Int)) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse8 .cse9 v_ArrVal_1500)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1503) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 .cse7)) (.cse11 (select .cse14 .cse6)) (.cse13 (select .cse14 .cse5)) (.cse10 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse10 2147483648) 0) (< 2147483647 (+ .cse11 .cse10)) (< .cse12 0) (<= 0 (+ .cse13 2147483648 .cse12)) (< (+ .cse11 .cse13) (+ .cse10 1)))))))) is different from false [2022-11-26 00:39:37,608 INFO L321 Elim1Store]: treesize reduction 58, result has 45.8 percent of original size [2022-11-26 00:39:37,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 574 treesize of output 309 [2022-11-26 00:39:37,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 522 [2022-11-26 00:39:37,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:37,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 522 treesize of output 520 [2022-11-26 00:39:37,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 462 treesize of output 402 [2022-11-26 00:39:37,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 402 treesize of output 372 [2022-11-26 00:39:37,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:37,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 726 treesize of output 682 [2022-11-26 00:39:37,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:37,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 596 treesize of output 540 [2022-11-26 00:39:37,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:37,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 540 treesize of output 512 [2022-11-26 00:39:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-26 00:39:39,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772693896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:39:39,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594805268] [2022-11-26 00:39:39,399 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-11-26 00:39:39,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:39:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:39:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261210505] [2022-11-26 00:39:39,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:39:39,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:39:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:39:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-11-26 00:39:39,400 INFO L87 Difference]: Start difference. First operand 777 states and 2740 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:47,030 INFO L93 Difference]: Finished difference Result 1139 states and 3471 transitions. [2022-11-26 00:39:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 00:39:47,030 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:39:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:47,034 INFO L225 Difference]: With dead ends: 1139 [2022-11-26 00:39:47,034 INFO L226 Difference]: Without dead ends: 1139 [2022-11-26 00:39:47,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=334, Invalid=1931, Unknown=3, NotChecked=282, Total=2550 [2022-11-26 00:39:47,035 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 702 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:47,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 0 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1917 Invalid, 0 Unknown, 602 Unchecked, 2.8s Time] [2022-11-26 00:39:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-11-26 00:39:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 777. [2022-11-26 00:39:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 738 states have (on average 3.6476964769647697) internal successors, (2692), 776 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 2692 transitions. [2022-11-26 00:39:47,058 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 2692 transitions. Word has length 13 [2022-11-26 00:39:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:47,059 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 2692 transitions. [2022-11-26 00:39:47,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 2692 transitions. [2022-11-26 00:39:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:39:47,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:47,060 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:47,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-26 00:39:47,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-11-26 00:39:47,268 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:39:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 230869922, now seen corresponding path program 3 times [2022-11-26 00:39:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925921553] [2022-11-26 00:39:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:48,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925921553] [2022-11-26 00:39:48,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925921553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:39:48,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177179761] [2022-11-26 00:39:48,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:39:48,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:39:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:48,353 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:39:48,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-26 00:39:48,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:39:48,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:39:48,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-26 00:39:48,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:39:48,947 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 16 treesize of output 12 [2022-11-26 00:39:49,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:39:49,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:49,119 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 19 treesize of output 21 [2022-11-26 00:39:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:39:49,219 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 19 treesize of output 21 [2022-11-26 00:39:50,723 INFO L321 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-11-26 00:39:50,724 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 651 treesize of output 528 [2022-11-26 00:39:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:52,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:39:56,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~j~0 4))) (let ((.cse7 (+ c_~A~0.offset .cse16)) (.cse6 (+ c_~A~0.offset .cse16 4)) (.cse5 (+ c_~A~0.offset 8 .cse16)) (.cse0 (not (< (+ c_~j~0 3) c_~N~0)))) (and (or .cse0 (forall ((v_ArrVal_1551 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse7)) (.cse2 (select .cse4 .cse6)) (.cse3 (select .cse4 .cse5))) (or (< (+ 9223372039002259455 .cse1) 0) (< 4294967295 .cse1) (not (<= 0 (+ c_~bag2~0 2147483648 .cse1))) (not (<= (+ c_~bag2~0 .cse2 c_~sum2~0 .cse1) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648 .cse1))) (< 2147483647 (+ c_~bag2~0 .cse2 .cse3 .cse1)) (< .cse3 2147483648) (not (<= 0 (+ c_~bag2~0 .cse2 c_~sum2~0 2147483648 .cse1))) (< (+ .cse2 .cse3) 1)))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (forall ((v_ArrVal_1551 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse5)) (.cse8 (select .cse11 .cse6)) (.cse9 (select .cse11 .cse7))) (or (not (<= 0 (+ .cse8 2147483648 .cse9))) (< 4294967295 .cse10) (< 2147483647 (+ .cse8 .cse10)) (< (+ c_~bag2~0 2147483648 .cse9) 0) (not (<= (+ c_~bag2~0 c_~sum2~0 .cse9) 2147483647)) (< 2147483647 (+ c_~bag2~0 .cse9)) (< .cse10 2147483648) (not (<= 0 (+ c_~bag2~0 .cse8 c_~sum2~0 2147483648 .cse9))) (not (<= (+ .cse8 .cse9) 2147483647)))))) .cse0) (or (forall ((v_ArrVal_1551 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5)) (.cse12 (select .cse15 .cse6)) (.cse13 (select .cse15 .cse7))) (or (not (<= 0 (+ .cse12 2147483648 .cse13))) (not (<= .cse13 4294967295)) (not (<= (+ c_~bag2~0 .cse13) 2147483647)) (< .cse14 2147483648) (< c_~bag2~0 (+ .cse12 1)) (< 2147483647 (+ .cse12 .cse14 .cse13)) (not (<= 0 (+ c_~bag2~0 .cse12 c_~sum2~0 2147483648 .cse13))))))) .cse0)))))) is different from false [2022-11-26 00:39:56,668 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 ((.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (not (< 3 c_~N~0)))) (and (or (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< (+ .cse1 .cse2) 1) (< 2147483647 (+ .cse1 .cse0 .cse2)) (< .cse2 2147483648) (< (+ .cse1 .cse0 2147483648) 0))))) .cse6) (or .cse6 (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 .cse5)) (.cse8 (select .cse10 .cse4)) (.cse7 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse7) (< 0 (+ .cse8 1)) (< 2147483647 (+ .cse8 .cse7 .cse9)) (< .cse9 2147483648) (< (+ .cse8 .cse7 2147483648) 0)))))) (or (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 .cse5)) (.cse11 (select .cse14 .cse4)) (.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse11 .cse12)) (< 4294967295 .cse12) (< 2147483647 .cse13) (< .cse12 2147483648) (< (+ .cse11 .cse13 2147483648) 0))))) .cse6)))) is different from false [2022-11-26 00:39:57,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 836 treesize of output 459 [2022-11-26 00:39:57,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 892 treesize of output 859 [2022-11-26 00:39:57,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 815 treesize of output 755 [2022-11-26 00:39:57,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 799 treesize of output 781 [2022-11-26 00:39:57,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 725 treesize of output 695 [2022-11-26 00:39:57,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 771 treesize of output 747 [2022-11-26 00:39:57,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 671 treesize of output 623 [2022-11-26 00:39:57,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 623 treesize of output 599 [2022-11-26 00:39:57,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,474 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 1375 treesize of output 1265 [2022-11-26 00:39:57,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1171 treesize of output 1067 [2022-11-26 00:39:57,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:39:57,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1067 treesize of output 1015 [2022-11-26 00:40:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 00:40:01,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177179761] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156980022] [2022-11-26 00:40:01,230 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-11-26 00:40:01,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:40:01,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:40:01,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427988143] [2022-11-26 00:40:01,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:40:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:40:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:40:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=739, Unknown=16, NotChecked=114, Total=992 [2022-11-26 00:40:01,232 INFO L87 Difference]: Start difference. First operand 777 states and 2692 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:02,465 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~bag2~0 2147483647) (and (= c_~A~0.offset 0) (<= (* c_~N~0 4) (+ c_~A~0.offset 3 (* c_~j~0 4))))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (not (< 3 c_~N~0)))) (and (or (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< (+ .cse1 .cse2) 1) (< 2147483647 (+ .cse1 .cse0 .cse2)) (< .cse2 2147483648) (< (+ .cse1 .cse0 2147483648) 0))))) .cse6) (or .cse6 (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 .cse5)) (.cse8 (select .cse10 .cse4)) (.cse7 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse7) (< 0 (+ .cse8 1)) (< 2147483647 (+ .cse8 .cse7 .cse9)) (< .cse9 2147483648) (< (+ .cse8 .cse7 2147483648) 0)))))) (or (forall ((v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1551) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 .cse5)) (.cse11 (select .cse14 .cse4)) (.cse13 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse11 .cse12)) (< 4294967295 .cse12) (< 2147483647 .cse13) (< .cse12 2147483648) (< (+ .cse11 .cse13 2147483648) 0))))) .cse6))))) is different from false [2022-11-26 00:40:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:40:13,191 INFO L93 Difference]: Finished difference Result 1893 states and 6093 transitions. [2022-11-26 00:40:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-26 00:40:13,192 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:40:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:40:13,196 INFO L225 Difference]: With dead ends: 1893 [2022-11-26 00:40:13,197 INFO L226 Difference]: Without dead ends: 1893 [2022-11-26 00:40:13,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=535, Invalid=2216, Unknown=17, NotChecked=312, Total=3080 [2022-11-26 00:40:13,197 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1832 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:40:13,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 0 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2018 Invalid, 0 Unknown, 312 Unchecked, 4.4s Time] [2022-11-26 00:40:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2022-11-26 00:40:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1251. [2022-11-26 00:40:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1212 states have (on average 3.872937293729373) internal successors, (4694), 1250 states have internal predecessors, (4694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4694 transitions. [2022-11-26 00:40:13,226 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 4694 transitions. Word has length 13 [2022-11-26 00:40:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:40:13,226 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 4694 transitions. [2022-11-26 00:40:13,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 4694 transitions. [2022-11-26 00:40:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:40:13,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:40:13,228 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:40:13,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-26 00:40:13,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:13,429 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:40:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:40:13,429 INFO L85 PathProgramCache]: Analyzing trace with hash 230869813, now seen corresponding path program 3 times [2022-11-26 00:40:13,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:40:13,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846536662] [2022-11-26 00:40:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:40:13,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:40:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:40:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:14,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:40:14,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846536662] [2022-11-26 00:40:14,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846536662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:40:14,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510172738] [2022-11-26 00:40:14,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:40:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:40:14,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:40:14,380 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:40:14,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-26 00:40:14,870 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:40:14,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:40:14,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:40:14,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:40:15,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:40:15,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:15,145 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 20 treesize of output 22 [2022-11-26 00:40:15,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:40:15,243 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 20 treesize of output 22 [2022-11-26 00:40:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:40:17,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:40:24,507 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse16 (<= c_~N~0 3)) (.cse0 (not (< 3 c_~N~0))) (.cse5 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse4 .cse7)) (.cse3 (select .cse4 .cse6))) (or (< (+ .cse1 .cse2 2147483648) 0) (< 2147483647 .cse1) (< 0 (+ .cse2 .cse3 1)) (< 0 (+ .cse2 1)) (< 0 (+ (select .cse4 .cse5) 9223372039002259456)) (< (+ .cse1 .cse2 2147483648 .cse3) 0)))))) (or .cse0 (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 .cse6)) (.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (select .cse10 .cse7))) (or (< 2147483647 .cse8) (< .cse8 (+ .cse9 1)) (< 0 (+ (select .cse10 .cse5) 9223372039002259456)) (< .cse8 (+ .cse11 .cse9 1)) (< (+ .cse11 2147483648 .cse9) 0) (< 2147483647 (+ .cse8 .cse11))))))) (or (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse15 .cse6)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (select .cse15 .cse7))) (or (< 2147483647 (+ .cse12 .cse13)) (< (+ .cse14 2147483648) 0) (< .cse12 1) (< 0 (+ (select .cse15 .cse5) 9223372039002259456)) (< (+ .cse12 2147483648 .cse13) 0) (< 2147483647 (+ .cse14 .cse12)))))) .cse16) (or (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse20 .cse6)) (.cse17 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (select .cse20 .cse7))) (or (< .cse17 (+ .cse18 1)) (< (+ .cse17 2147483648) 0) (< .cse19 1) (< 0 (+ (select .cse20 .cse5) 9223372039002259456)) (< (+ .cse19 2147483648 .cse18) 0) (< 2147483647 (+ .cse17 .cse19)))))) .cse0) (or (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse23 (select .cse24 .cse6)) (.cse21 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse24 .cse7))) (or (< (+ .cse21 .cse22 2147483648) 0) (< 2147483647 .cse21) (< 2147483647 (+ .cse22 .cse23)) (< (+ .cse21 2147483648) 0) (< 0 (+ (select .cse24 .cse5) 9223372039002259456)) (< 4294967295 .cse23) (< (+ .cse22 2147483648 .cse23) 0) (< 2147483647 (+ .cse21 .cse22)))))) .cse16) (or (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse28 .cse7)) (.cse27 (select .cse28 .cse6))) (or (< (+ .cse25 .cse26 2147483648) 0) (< 2147483647 .cse25) (< 2147483647 (+ .cse25 .cse26 .cse27)) (< 0 (+ .cse26 1)) (< 0 (+ (select .cse28 .cse5) 9223372039002259456)) (< (+ .cse25 .cse26 2147483648 .cse27) 0))))) .cse16) (or .cse0 (forall ((v_ArrVal_1597 (Array Int Int)) (v_ArrVal_1596 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse32 .cse6)) (.cse29 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse30 (select .cse32 .cse7))) (or (< (+ .cse29 .cse30 2147483648) 0) (< 2147483647 .cse29) (< 2147483647 (+ .cse29 .cse30 .cse31)) (< (+ .cse29 2147483648) 0) (< 0 (+ (select .cse32 .cse5) 9223372039002259456)) (< (+ .cse29 .cse30 2147483648 .cse31) 0) (< 2147483647 (+ .cse29 .cse30))))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-26 00:40:24,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:24,597 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 2008 treesize of output 1121 [2022-11-26 00:40:24,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:24,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6102 treesize of output 5450 [2022-11-26 00:40:24,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:24,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5404 treesize of output 5332 [2022-11-26 00:40:24,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:24,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5332 treesize of output 5188 [2022-11-26 00:40:24,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:24,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5188 treesize of output 5044 [2022-11-26 00:40:25,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5044 treesize of output 4972 [2022-11-26 00:40:25,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4972 treesize of output 4912 [2022-11-26 00:40:25,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4912 treesize of output 4882 [2022-11-26 00:40:25,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4882 treesize of output 4802 [2022-11-26 00:40:25,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4802 treesize of output 4722 [2022-11-26 00:40:25,563 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4722 treesize of output 4682 [2022-11-26 00:40:25,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4682 treesize of output 4614 [2022-11-26 00:40:25,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4614 treesize of output 4478 [2022-11-26 00:40:25,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4478 treesize of output 4350 [2022-11-26 00:40:25,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:25,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4350 treesize of output 4286 [2022-11-26 00:40:26,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:40:26,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4286 treesize of output 4126 [2022-11-26 00:40:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 00:40:31,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510172738] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:40:31,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158857852] [2022-11-26 00:40:31,095 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-11-26 00:40:31,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:40:31,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:40:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837798526] [2022-11-26 00:40:31,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:40:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:40:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:40:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:40:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=795, Unknown=3, NotChecked=58, Total=992 [2022-11-26 00:40:31,097 INFO L87 Difference]: Start difference. First operand 1251 states and 4694 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:40:58,535 WARN L233 SmtUtils]: Spent 24.09s on a formula simplification. DAG size of input: 254 DAG size of output: 250 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:41:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:41:04,447 INFO L93 Difference]: Finished difference Result 1619 states and 5320 transitions. [2022-11-26 00:41:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:41:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:41:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:41:04,452 INFO L225 Difference]: With dead ends: 1619 [2022-11-26 00:41:04,452 INFO L226 Difference]: Without dead ends: 1619 [2022-11-26 00:41:04,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=522, Invalid=2235, Unknown=3, NotChecked=102, Total=2862 [2022-11-26 00:41:04,453 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1602 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:41:04,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 0 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1356 Invalid, 0 Unknown, 128 Unchecked, 3.0s Time] [2022-11-26 00:41:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-11-26 00:41:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1251. [2022-11-26 00:41:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1212 states have (on average 3.793729372937294) internal successors, (4598), 1250 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4598 transitions. [2022-11-26 00:41:04,487 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 4598 transitions. Word has length 13 [2022-11-26 00:41:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:41:04,487 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 4598 transitions. [2022-11-26 00:41:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 4598 transitions. [2022-11-26 00:41:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:41:04,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:41:04,489 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:41:04,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-26 00:41:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:04,696 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:41:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:41:04,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1511362203, now seen corresponding path program 2 times [2022-11-26 00:41:04,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:41:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403061622] [2022-11-26 00:41:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:41:04,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:41:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:05,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:41:05,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403061622] [2022-11-26 00:41:05,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403061622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:41:05,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293404484] [2022-11-26 00:41:05,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:41:05,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:05,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:41:05,282 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:41:05,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-26 00:41:05,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:41:05,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:41:05,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-26 00:41:05,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:41:05,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:41:05,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:05,892 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 25 treesize of output 24 [2022-11-26 00:41:05,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:05,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:41:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:06,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:41:06,462 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1636 (Array Int Int)) (v_~i~0_260 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse0 (+ (* v_~i~0_260 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse1) 2147483648) (not (<= .cse1 0)) (not (<= 0 (+ 9223372039002259455 .cse1))))))) is different from false [2022-11-26 00:41:06,480 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1636 (Array Int Int)) (v_~i~0_260 Int) (v_ArrVal_1634 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1634)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_260 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse0 0)) (not (<= 0 (+ .cse0 9223372039002259455))) (< (+ .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2147483648))))) is different from false [2022-11-26 00:41:06,519 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-26 00:41:06,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 82 [2022-11-26 00:41:06,561 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-26 00:41:06,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 112 [2022-11-26 00:41:06,572 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:41:06,572 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 72 treesize of output 50 [2022-11-26 00:41:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:41:06,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293404484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:41:06,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [840355290] [2022-11-26 00:41:06,684 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-26 00:41:06,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:41:06,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-11-26 00:41:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360749141] [2022-11-26 00:41:06,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:41:06,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-26 00:41:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:41:06,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-26 00:41:06,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=404, Unknown=2, NotChecked=82, Total=552 [2022-11-26 00:41:06,686 INFO L87 Difference]: Start difference. First operand 1251 states and 4598 transitions. Second operand has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:08,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:41:08,673 INFO L93 Difference]: Finished difference Result 2645 states and 8983 transitions. [2022-11-26 00:41:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:41:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:41:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:41:08,680 INFO L225 Difference]: With dead ends: 2645 [2022-11-26 00:41:08,680 INFO L226 Difference]: Without dead ends: 2645 [2022-11-26 00:41:08,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=259, Invalid=1229, Unknown=2, NotChecked=150, Total=1640 [2022-11-26 00:41:08,681 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:41:08,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 222 Unchecked, 1.2s Time] [2022-11-26 00:41:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2022-11-26 00:41:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1392. [2022-11-26 00:41:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1353 states have (on average 3.90169992609017) internal successors, (5279), 1391 states have internal predecessors, (5279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 5279 transitions. [2022-11-26 00:41:08,710 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 5279 transitions. Word has length 13 [2022-11-26 00:41:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:41:08,710 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 5279 transitions. [2022-11-26 00:41:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 5279 transitions. [2022-11-26 00:41:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:41:08,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:41:08,711 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:41:08,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-11-26 00:41:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-26 00:41:08,912 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:41:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:41:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1511362207, now seen corresponding path program 1 times [2022-11-26 00:41:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:41:08,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090695137] [2022-11-26 00:41:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:41:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:41:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:41:09,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:41:09,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090695137] [2022-11-26 00:41:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090695137] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:41:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412703707] [2022-11-26 00:41:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:41:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:41:09,399 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:41:09,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-26 00:41:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:09,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 00:41:09,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:41:10,609 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 34 treesize of output 10 [2022-11-26 00:41:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:41:10,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:41:11,304 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 00:41:11,305 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 167 treesize of output 1 [2022-11-26 00:41:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:41:11,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412703707] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:41:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591940031] [2022-11-26 00:41:11,306 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-11-26 00:41:11,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:41:11,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-26 00:41:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565156033] [2022-11-26 00:41:11,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:41:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 00:41:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:41:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 00:41:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:41:11,307 INFO L87 Difference]: Start difference. First operand 1392 states and 5279 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:13,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:41:16,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:41:18,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:41:21,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:41:23,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:41:25,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:41:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:41:26,874 INFO L93 Difference]: Finished difference Result 3958 states and 13400 transitions. [2022-11-26 00:41:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-26 00:41:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:41:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:41:26,885 INFO L225 Difference]: With dead ends: 3958 [2022-11-26 00:41:26,885 INFO L226 Difference]: Without dead ends: 3958 [2022-11-26 00:41:26,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=447, Invalid=1623, Unknown=0, NotChecked=0, Total=2070 [2022-11-26 00:41:26,886 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 51 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:41:26,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1081 Invalid, 6 Unknown, 0 Unchecked, 13.9s Time] [2022-11-26 00:41:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2022-11-26 00:41:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 1864. [2022-11-26 00:41:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1825 states have (on average 3.9994520547945207) internal successors, (7299), 1863 states have internal predecessors, (7299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 7299 transitions. [2022-11-26 00:41:26,975 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 7299 transitions. Word has length 13 [2022-11-26 00:41:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:41:26,975 INFO L495 AbstractCegarLoop]: Abstraction has 1864 states and 7299 transitions. [2022-11-26 00:41:26,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 7299 transitions. [2022-11-26 00:41:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:41:26,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:41:26,978 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-11-26 00:41:26,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-26 00:41:27,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-11-26 00:41:27,190 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:41:27,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:41:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 216509306, now seen corresponding path program 2 times [2022-11-26 00:41:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:41:27,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170784444] [2022-11-26 00:41:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:41:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:41:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:27,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:41:27,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170784444] [2022-11-26 00:41:27,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170784444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:41:27,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473007081] [2022-11-26 00:41:27,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:41:27,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:27,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:41:27,787 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:41:27,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-26 00:41:28,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:41:28,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:41:28,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-26 00:41:28,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:41:28,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:41:28,513 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-26 00:41:28,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-26 00:41:28,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:28,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-26 00:41:28,764 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 21 treesize of output 13 [2022-11-26 00:41:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:28,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:41:31,269 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-26 00:41:31,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 48 [2022-11-26 00:41:31,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:31,282 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 51 treesize of output 47 [2022-11-26 00:41:31,288 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 9 treesize of output 5 [2022-11-26 00:41:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:31,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473007081] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:41:31,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1008005826] [2022-11-26 00:41:31,443 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-11-26 00:41:31,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:41:31,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-26 00:41:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351438747] [2022-11-26 00:41:31,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:41:31,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-26 00:41:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:41:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-26 00:41:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=671, Unknown=1, NotChecked=0, Total=756 [2022-11-26 00:41:31,444 INFO L87 Difference]: Start difference. First operand 1864 states and 7299 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:41:35,959 INFO L93 Difference]: Finished difference Result 3842 states and 13293 transitions. [2022-11-26 00:41:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-26 00:41:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:41:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:41:35,970 INFO L225 Difference]: With dead ends: 3842 [2022-11-26 00:41:35,970 INFO L226 Difference]: Without dead ends: 3842 [2022-11-26 00:41:35,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=594, Invalid=3311, Unknown=1, NotChecked=0, Total=3906 [2022-11-26 00:41:35,971 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:41:35,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-26 00:41:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2022-11-26 00:41:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 1723. [2022-11-26 00:41:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1684 states have (on average 3.931710213776722) internal successors, (6621), 1722 states have internal predecessors, (6621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 6621 transitions. [2022-11-26 00:41:36,014 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 6621 transitions. Word has length 13 [2022-11-26 00:41:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:41:36,014 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 6621 transitions. [2022-11-26 00:41:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:41:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 6621 transitions. [2022-11-26 00:41:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:41:36,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:41:36,046 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 00:41:36,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-26 00:41:36,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:36,247 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:41:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:41:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1981603015, now seen corresponding path program 4 times [2022-11-26 00:41:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:41:36,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95977108] [2022-11-26 00:41:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:41:36,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:41:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:37,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:41:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95977108] [2022-11-26 00:41:37,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95977108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:41:37,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143292003] [2022-11-26 00:41:37,162 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:41:37,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:41:37,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:41:37,163 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:41:37,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-26 00:41:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:41:37,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-26 00:41:37,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:41:37,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:41:38,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:38,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-26 00:41:38,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:38,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:41:38,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:41:38,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:41:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:41:40,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:41:47,066 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse33 (* c_~j~0 4))) (let ((.cse2 (+ c_~A~0.offset 12 .cse33)) (.cse6 (+ c_~A~0.offset .cse33 4)) (.cse5 (+ c_~A~0.offset .cse33)) (.cse7 (+ c_~A~0.offset 8 .cse33))) (and (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse7)) (.cse4 (select .cse1 .cse6)) (.cse0 (select .cse1 .cse5))) (or (not (<= 0 (+ .cse0 c_~bag2~0 c_~sum2~0 2147483648))) (< 0 (+ (select .cse1 .cse2) 9223372039002259456)) (not (<= (+ .cse0 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse3 2147483648 .cse4))) (< .cse4 1) (< (+ .cse0 9223372039002259455) 0) (< (+ .cse0 c_~bag2~0) (+ .cse3 1)) (not (<= (+ .cse0 c_~bag2~0 .cse4) 2147483647)) (not (<= .cse0 4294967295)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))))))) (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse10 (select .cse8 .cse7)) (.cse11 (select .cse8 .cse6)) (.cse9 (select .cse8 .cse5))) (or (< 0 (+ (select .cse8 .cse2) 9223372039002259456)) (not (<= (+ .cse9 c_~bag2~0 .cse10 .cse11) 2147483647)) (not (<= (+ .cse9 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse9 c_~bag2~0 .cse10 2147483648 .cse11))) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648 .cse11))) (< (+ .cse9 9223372039002259455) 0) (not (<= (+ .cse9 c_~bag2~0 .cse11) 2147483647)) (not (<= .cse9 4294967295)) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648))))))) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse7)) (.cse12 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse6))) (or (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse13 .cse14) 2147483647)) (< 0 (+ (select .cse15 .cse2) 9223372039002259456)) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse13 2147483648 .cse14))) (not (<= (+ .cse12 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse12 c_~bag2~0 c_~sum2~0 2147483648 .cse14))) (not (<= 0 (+ .cse12 2147483648 .cse14))) (not (<= (+ .cse12 .cse14) 2147483647)) (not (<= .cse13 4294967295)) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse14) 2147483647)))))) (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse16 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse7)) (.cse18 (select .cse19 .cse6))) (or (< (+ .cse16 .cse17 2147483648 .cse18) 0) (< 0 (+ (select .cse19 .cse2) 9223372039002259456)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)) (< (+ .cse16 c_~bag2~0 c_~sum2~0 2147483648 .cse18) 0) (not (<= 0 (+ .cse16 2147483648 .cse18))) (< 2147483647 (+ .cse16 c_~bag2~0 c_~sum2~0 .cse18)) (< c_~bag2~0 (+ 1 .cse18)) (not (<= .cse16 4294967295)) (< 2147483647 (+ .cse16 .cse17 .cse18)))))) (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse5)) (.cse21 (select .cse23 .cse7)) (.cse22 (select .cse23 .cse6))) (or (not (<= 0 (+ .cse20 .cse21 2147483648 .cse22))) (< 0 (+ (select .cse23 .cse2) 9223372039002259456)) (not (<= (+ .cse20 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse20 2147483648 .cse22))) (< c_~bag2~0 (+ 1 .cse22)) (not (<= .cse20 4294967295)) (< c_~bag2~0 (+ .cse21 1 .cse22)))))) (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse24 (select .cse25 .cse5))) (let ((.cse28 (+ .cse24 c_~bag2~0)) (.cse26 (select .cse25 .cse7)) (.cse27 (select .cse25 .cse6))) (or (not (<= 0 (+ .cse24 c_~bag2~0 c_~sum2~0 2147483648))) (< 0 (+ (select .cse25 .cse2) 9223372039002259456)) (not (<= (+ .cse24 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ .cse26 2147483648 .cse27))) (not (<= .cse28 2147483647)) (not (<= .cse27 4294967295)) (not (<= (+ .cse24 .cse27) 2147483647)) (< .cse24 (+ .cse26 1)) (< .cse28 (+ .cse26 1 .cse27))))))))) (forall ((v_ArrVal_1761 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) c_~A~0.base))) (let ((.cse30 (select .cse32 .cse7)) (.cse29 (select .cse32 .cse5)) (.cse31 (select .cse32 .cse6))) (or (not (<= 0 (+ .cse29 c_~bag2~0 c_~sum2~0 2147483648))) (not (<= (+ .cse30 .cse31) 2147483647)) (< 0 (+ (select .cse32 .cse2) 9223372039002259456)) (not (<= 0 (+ .cse30 2147483648 .cse31))) (< .cse31 1) (< (+ .cse29 9223372039002259455) 0) (not (<= (+ .cse29 c_~bag2~0 .cse31) 2147483647)) (not (<= .cse29 4294967295)) (not (<= 0 (+ .cse29 c_~bag2~0 2147483648))) (not (<= (+ .cse29 c_~bag2~0 c_~sum2~0 .cse31) 2147483647))))))))) is different from false [2022-11-26 00:41:47,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 .cse6)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5))) (or (< 2147483647 .cse0) (< 2147483647 (+ .cse1 .cse0 .cse2)) (< (+ .cse0 .cse2 2147483648) 0) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)) (< 0 (+ .cse2 1)) (< (+ .cse1 .cse0 .cse2 2147483648) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (select .cse8 .cse6)) (.cse9 (select .cse8 .cse5))) (or (< (+ .cse7 2147483648) 0) (< 0 (+ (select .cse8 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse7 .cse9)) (< (+ .cse10 .cse9 2147483648) 0) (< 2147483647 (+ .cse10 .cse9)) (< .cse9 1))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 .cse6)) (.cse11 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select .cse12 .cse5))) (or (not (<= .cse11 2147483647)) (< 0 (+ (select .cse12 .cse4) 9223372039002259456)) (not (<= 0 (+ .cse11 2147483648))) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= (+ .cse11 .cse14) 2147483647)) (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= .cse13 4294967295)) (not (<= 0 (+ .cse11 .cse14 2147483648))))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse17 .cse6)) (.cse15 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (select .cse17 .cse5))) (or (< 2147483647 .cse15) (< (+ .cse15 .cse16 2147483648) 0) (< 0 (+ (select .cse17 .cse4) 9223372039002259456)) (< 0 (+ .cse16 1)) (< 0 (+ .cse18 .cse16 1)) (< (+ .cse18 .cse15 .cse16 2147483648) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse20 (select .cse22 .cse6)) (.cse19 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (select .cse22 .cse5))) (or (< 2147483647 .cse19) (< (+ .cse19 2147483648) 0) (< 2147483647 (+ .cse20 .cse19 .cse21)) (< (+ .cse19 .cse21 2147483648) 0) (< 0 (+ (select .cse22 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse19 .cse21)) (< (+ .cse20 .cse19 .cse21 2147483648) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse24 .cse5)) (.cse23 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse24 .cse6))) (or (< (+ .cse23 2147483648) 0) (< 0 (+ (select .cse24 .cse4) 9223372039002259456)) (< 2147483647 (+ .cse23 .cse25)) (< (+ .cse26 .cse25 2147483648) 0) (< .cse25 1) (< .cse23 (+ .cse26 1)))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse28 .cse5)) (.cse27 (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse28 .cse6))) (or (not (<= .cse27 2147483647)) (< 0 (+ (select .cse28 .cse4) 9223372039002259456)) (not (<= 0 (+ .cse29 .cse30 2147483648))) (not (<= (+ .cse27 .cse30) 2147483647)) (< .cse27 (+ .cse29 .cse30 1)) (< .cse27 (+ .cse29 1)))))))) is different from false [2022-11-26 00:41:47,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse0 .cse6)) (.cse2 (select .cse0 .cse5)) (.cse4 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse0 .cse1) 9223372039002259456)) (< (+ .cse2 .cse3 2147483648 .cse4) 0) (< 2147483647 .cse4) (< 2147483647 (+ .cse2 .cse4)) (< 2147483647 (+ .cse2 .cse3 .cse4)) (< (+ 2147483648 .cse4) 0) (< (+ .cse2 2147483648 .cse4) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (select .cse9 .cse5)) (.cse12 (select .cse9 .cse6))) (or (< 0 (+ (select .cse9 .cse1) 9223372039002259456)) (< .cse10 1) (< 2147483647 (+ .cse10 .cse11)) (< .cse11 (+ .cse12 1)) (< (+ 2147483648 .cse11) 0) (< (+ .cse10 .cse12 2147483648) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse13 .cse5)) (.cse16 (select .cse13 .cse6)) (.cse15 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse13 .cse1) 9223372039002259456)) (not (<= 0 (+ .cse14 2147483648 .cse15))) (not (<= .cse16 4294967295)) (not (<= 0 (+ .cse14 .cse16 2147483648))) (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= 0 (+ 2147483648 .cse15))) (not (<= (+ .cse14 .cse16) 2147483647)) (not (<= .cse15 2147483647)))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse17 .cse6)) (.cse18 (select .cse17 .cse5)) (.cse20 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse17 .cse1) 9223372039002259456)) (< (+ .cse18 .cse19 2147483648 .cse20) 0) (< 0 (+ .cse18 1)) (< 2147483647 .cse20) (< 2147483647 (+ .cse18 .cse19 .cse20)) (< (+ .cse18 2147483648 .cse20) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse21 .cse5)) (.cse23 (select .cse21 .cse6))) (or (< 0 (+ (select .cse21 .cse1) 9223372039002259456)) (not (<= 0 (+ .cse22 .cse23 2147483648))) (not (<= (+ .cse22 .cse24) 2147483647)) (< .cse24 (+ .cse23 1)) (not (<= .cse24 2147483647)) (< .cse24 (+ .cse22 .cse23 1)))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse25 .cse5)) (.cse27 (select .cse25 .cse6))) (or (< 0 (+ (select .cse25 .cse1) 9223372039002259456)) (< 2147483647 (+ .cse26 .cse27)) (< .cse26 1) (< 2147483647 (+ .cse26 .cse28)) (< (+ 2147483648 .cse28) 0) (< (+ .cse26 .cse27 2147483648) 0))))) (forall ((v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1758 Int)) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_1758)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1760) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1761) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse29 .cse6)) (.cse30 (select .cse29 .cse5)) (.cse32 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ (select .cse29 .cse1) 9223372039002259456)) (< (+ .cse30 .cse31 2147483648 .cse32) 0) (< 0 (+ .cse30 .cse31 1)) (< 0 (+ .cse30 1)) (< 2147483647 .cse32) (< (+ .cse30 2147483648 .cse32) 0))))))) is different from false [2022-11-26 00:41:48,337 INFO L321 Elim1Store]: treesize reduction 203, result has 45.4 percent of original size [2022-11-26 00:41:48,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 2518 treesize of output 1451 [2022-11-26 00:41:48,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 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 3181 treesize of output 3176 [2022-11-26 00:41:48,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 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 4242 treesize of output 4194 [2022-11-26 00:41:48,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4130 treesize of output 4062 [2022-11-26 00:41:48,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4062 treesize of output 4028 [2022-11-26 00:41:49,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:49,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 4105 treesize of output 4105 [2022-11-26 00:41:49,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:49,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5910 treesize of output 5826 [2022-11-26 00:41:49,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:49,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5792 treesize of output 5766 [2022-11-26 00:41:49,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5715 treesize of output 5679 [2022-11-26 00:41:49,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5679 treesize of output 5607 [2022-11-26 00:41:49,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5607 treesize of output 5547 [2022-11-26 00:41:50,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5547 treesize of output 5467 [2022-11-26 00:41:50,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5467 treesize of output 5307 [2022-11-26 00:41:50,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:50,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5559 treesize of output 5423 [2022-11-26 00:41:50,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:50,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5244 treesize of output 5242 [2022-11-26 00:41:50,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5191 treesize of output 5071 [2022-11-26 00:41:51,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:51,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 5088 treesize of output 5042 [2022-11-26 00:41:51,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4991 treesize of output 4911 [2022-11-26 00:41:51,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4911 treesize of output 4751 [2022-11-26 00:41:51,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4751 treesize of output 4687 [2022-11-26 00:41:51,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:51,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5083 treesize of output 4909 [2022-11-26 00:41:51,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:51,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4623 treesize of output 4495 [2022-11-26 00:41:52,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:52,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4495 treesize of output 4351 [2022-11-26 00:41:52,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:41:52,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4351 treesize of output 4279 [2022-11-26 00:42:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-26 00:42:26,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143292003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:42:26,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1643796810] [2022-11-26 00:42:26,622 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-11-26 00:42:26,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:42:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-26 00:42:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861208232] [2022-11-26 00:42:26,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:42:26,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-26 00:42:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:42:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-26 00:42:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=899, Unknown=3, NotChecked=186, Total=1190 [2022-11-26 00:42:26,624 INFO L87 Difference]: Start difference. First operand 1723 states and 6621 transitions. Second operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:42:37,326 INFO L93 Difference]: Finished difference Result 2059 states and 7214 transitions. [2022-11-26 00:42:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 00:42:37,326 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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 14 [2022-11-26 00:42:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:42:37,331 INFO L225 Difference]: With dead ends: 2059 [2022-11-26 00:42:37,331 INFO L226 Difference]: Without dead ends: 2059 [2022-11-26 00:42:37,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=243, Invalid=1746, Unknown=3, NotChecked=264, Total=2256 [2022-11-26 00:42:37,331 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 831 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:42:37,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 0 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2836 Invalid, 0 Unknown, 467 Unchecked, 4.3s Time] [2022-11-26 00:42:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2022-11-26 00:42:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1723. [2022-11-26 00:42:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1684 states have (on average 3.8652019002375297) internal successors, (6509), 1722 states have internal predecessors, (6509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 6509 transitions. [2022-11-26 00:42:37,373 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 6509 transitions. Word has length 14 [2022-11-26 00:42:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:42:37,373 INFO L495 AbstractCegarLoop]: Abstraction has 1723 states and 6509 transitions. [2022-11-26 00:42:37,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 6509 transitions. [2022-11-26 00:42:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:42:37,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:42:37,374 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2022-11-26 00:42:37,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-11-26 00:42:37,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-26 00:42:37,575 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:42:37,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:42:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -702653054, now seen corresponding path program 3 times [2022-11-26 00:42:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:42:37,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548765809] [2022-11-26 00:42:37,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:42:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:42:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:42:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:38,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:42:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548765809] [2022-11-26 00:42:38,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548765809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:42:38,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94886465] [2022-11-26 00:42:38,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:42:38,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:38,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:42:38,077 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:42:38,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-26 00:42:38,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:42:38,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:42:38,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-26 00:42:38,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:42:38,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:42:38,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:38,776 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 25 treesize of output 24 [2022-11-26 00:42:38,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:38,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:42:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:39,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:42:39,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1804 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1804) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-26 00:42:39,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1803 Int) (v_ArrVal_1804 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1803)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1804) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-26 00:42:39,360 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-26 00:42:39,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-11-26 00:42:39,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:42:39,372 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 37 treesize of output 33 [2022-11-26 00:42:39,378 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 7 treesize of output 3 [2022-11-26 00:42:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-26 00:42:39,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94886465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:42:39,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [471844332] [2022-11-26 00:42:39,516 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-11-26 00:42:39,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:42:39,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:42:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792197014] [2022-11-26 00:42:39,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:42:39,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:42:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:42:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:42:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=786, Unknown=2, NotChecked=114, Total=992 [2022-11-26 00:42:39,518 INFO L87 Difference]: Start difference. First operand 1723 states and 6509 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:42:40,972 INFO L93 Difference]: Finished difference Result 2237 states and 7948 transitions. [2022-11-26 00:42:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:42:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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 14 [2022-11-26 00:42:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:42:40,978 INFO L225 Difference]: With dead ends: 2237 [2022-11-26 00:42:40,978 INFO L226 Difference]: Without dead ends: 2237 [2022-11-26 00:42:40,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=1231, Unknown=2, NotChecked=146, Total=1560 [2022-11-26 00:42:40,979 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:42:40,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 873 Invalid, 0 Unknown, 102 Unchecked, 1.0s Time] [2022-11-26 00:42:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2022-11-26 00:42:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 1735. [2022-11-26 00:42:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1696 states have (on average 3.8579009433962264) internal successors, (6543), 1734 states have internal predecessors, (6543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 6543 transitions. [2022-11-26 00:42:41,012 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 6543 transitions. Word has length 14 [2022-11-26 00:42:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:42:41,012 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 6543 transitions. [2022-11-26 00:42:41,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 6543 transitions. [2022-11-26 00:42:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:42:41,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:42:41,015 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2022-11-26 00:42:41,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-26 00:42:41,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:41,223 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:42:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:42:41,223 INFO L85 PathProgramCache]: Analyzing trace with hash -702653128, now seen corresponding path program 2 times [2022-11-26 00:42:41,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:42:41,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382911714] [2022-11-26 00:42:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:42:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:42:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:42:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:41,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:42:41,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382911714] [2022-11-26 00:42:41,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382911714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:42:41,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147333454] [2022-11-26 00:42:41,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:42:41,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:41,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:42:41,738 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:42:41,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-26 00:42:42,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:42:42,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:42:42,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-26 00:42:42,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:42:42,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:42:42,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:42,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-26 00:42:42,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:42,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:42:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:42,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:42:43,146 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1845 Int) (v_ArrVal_1847 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1845)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1847) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-26 00:42:43,177 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-26 00:42:43,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-11-26 00:42:43,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:42:43,187 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 43 treesize of output 39 [2022-11-26 00:42:43,204 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 9 treesize of output 5 [2022-11-26 00:42:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 00:42:43,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147333454] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:42:43,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1734960019] [2022-11-26 00:42:43,337 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-11-26 00:42:43,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:42:43,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:42:43,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742526391] [2022-11-26 00:42:43,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:42:43,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:42:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:42:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:42:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=833, Unknown=7, NotChecked=58, Total=992 [2022-11-26 00:42:43,342 INFO L87 Difference]: Start difference. First operand 1735 states and 6543 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:42:44,957 INFO L93 Difference]: Finished difference Result 2235 states and 7940 transitions. [2022-11-26 00:42:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:42:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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 14 [2022-11-26 00:42:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:42:44,963 INFO L225 Difference]: With dead ends: 2235 [2022-11-26 00:42:44,963 INFO L226 Difference]: Without dead ends: 2235 [2022-11-26 00:42:44,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=1286, Unknown=7, NotChecked=74, Total=1560 [2022-11-26 00:42:44,964 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:42:44,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1077 Invalid, 0 Unknown, 61 Unchecked, 1.2s Time] [2022-11-26 00:42:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2022-11-26 00:42:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1735. [2022-11-26 00:42:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1696 states have (on average 3.85436320754717) internal successors, (6537), 1734 states have internal predecessors, (6537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 6537 transitions. [2022-11-26 00:42:44,997 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 6537 transitions. Word has length 14 [2022-11-26 00:42:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:42:44,997 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 6537 transitions. [2022-11-26 00:42:44,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:42:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 6537 transitions. [2022-11-26 00:42:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:42:44,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:42:44,999 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-26 00:42:45,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-26 00:42:45,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:45,200 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:42:45,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:42:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1432963797, now seen corresponding path program 5 times [2022-11-26 00:42:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:42:45,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705455940] [2022-11-26 00:42:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:42:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:42:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:42:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:45,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:42:45,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705455940] [2022-11-26 00:42:45,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705455940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:42:45,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012567223] [2022-11-26 00:42:45,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:42:45,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:42:45,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:42:45,607 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:42:45,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-26 00:42:46,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:42:46,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:42:46,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:42:46,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:42:46,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:42:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:46,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:42:46,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:42:46,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:42:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:42:51,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:43:05,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse138 (* c_~j~0 4)) (.cse137 (+ c_~j~0 4))) (let ((.cse17 (not (< .cse137 c_~N~0))) (.cse3 (+ c_~A~0.offset 16 .cse138)) (.cse8 (+ c_~A~0.offset .cse138)) (.cse6 (+ c_~A~0.offset 8 .cse138)) (.cse7 (+ c_~A~0.offset .cse138 4)) (.cse9 (+ c_~A~0.offset 12 .cse138)) (.cse10 (<= c_~N~0 .cse137))) (and (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse4 (select .cse2 .cse9)) (.cse0 (select .cse2 .cse8)) (.cse1 (select .cse2 .cse7)) (.cse5 (select .cse2 .cse6))) (or (< 2147483647 (+ c_~bag2~0 .cse0 .cse1)) (< (select .cse2 .cse3) 4294967296) (< (+ .cse4 .cse1 .cse5 2147483648) 0) (< (+ c_~bag2~0 .cse0) (+ .cse5 1)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ .cse4 .cse1 .cse5)) (not (<= 0 (+ .cse1 .cse5 2147483648))) (< (+ c_~bag2~0 .cse0 c_~sum2~0 .cse1 .cse5 2147483648) 0) (not (<= 0 (+ 9223372039002259455 .cse0))) (< .cse1 1) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< 4294967295 .cse0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0 .cse1 .cse5)))))) .cse10) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse15 (select .cse12 .cse8)) (.cse13 (select .cse12 .cse7))) (let ((.cse11 (+ c_~bag2~0 .cse15 .cse13)) (.cse16 (select .cse12 .cse9)) (.cse14 (select .cse12 .cse6))) (or (< 2147483647 .cse11) (< (select .cse12 .cse3) 4294967296) (not (<= (+ .cse13 .cse14) 2147483647)) (< (+ c_~bag2~0 .cse15 c_~sum2~0 2147483648) 0) (< .cse13 (+ .cse16 1)) (not (<= 0 (+ .cse16 .cse14 2147483648))) (< .cse11 (+ .cse16 .cse14 1)) (not (<= (+ c_~bag2~0 .cse15 c_~sum2~0 .cse13) 2147483647)) (not (<= 0 (+ 9223372039002259455 .cse15))) (< .cse13 1) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (< 4294967295 .cse15)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse8))) (let ((.cse21 (+ c_~bag2~0 .cse18)) (.cse23 (select .cse20 .cse9)) (.cse22 (select .cse20 .cse6)) (.cse19 (select .cse20 .cse7))) (or (< 2147483647 (+ c_~bag2~0 .cse18 .cse19)) (< (select .cse20 .cse3) 4294967296) (< .cse21 (+ .cse22 1)) (< (+ c_~bag2~0 .cse18 c_~sum2~0 2147483648) 0) (< .cse21 (+ .cse23 .cse22 1)) (not (<= 0 (+ .cse19 .cse22 2147483648))) (not (<= 0 (+ 9223372039002259455 .cse18))) (not (<= 0 (+ .cse23 .cse19 .cse22 2147483648))) (< .cse19 1) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))) (< 2147483647 (+ c_~bag2~0 .cse18 c_~sum2~0)) (< 4294967295 .cse18)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse9)) (.cse28 (select .cse27 .cse6)) (.cse24 (select .cse27 .cse8)) (.cse25 (select .cse27 .cse7))) (or (< (+ c_~bag2~0 .cse24 .cse25) (+ .cse26 1)) (< (+ c_~bag2~0 .cse24 c_~sum2~0 .cse25 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse24 c_~sum2~0 .cse25)) (< (select .cse27 .cse3) 4294967296) (not (<= 0 (+ .cse26 .cse28 2147483648))) (< .cse28 1) (< (+ .cse25 .cse28) 1) (not (<= 0 (+ 9223372039002259455 .cse24))) (< 2147483647 (+ c_~bag2~0 .cse24 .cse25 .cse28)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (< 4294967295 .cse24) (not (<= 0 (+ c_~bag2~0 .cse24 .cse25 2147483648))))))) .cse17) (or .cse17 (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse32 (select .cse31 .cse9)) (.cse33 (select .cse31 .cse6)) (.cse29 (select .cse31 .cse8)) (.cse30 (select .cse31 .cse7))) (or (< (+ c_~bag2~0 .cse29 c_~sum2~0 .cse30 2147483648) 0) (< (select .cse31 .cse3) 4294967296) (not (<= (+ .cse32 .cse33) 2147483647)) (not (<= 0 (+ .cse32 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse29 c_~sum2~0 .cse30 .cse33) 2147483647)) (< .cse33 1) (< (+ .cse30 .cse33) 1) (not (<= 0 (+ 9223372039002259455 .cse29))) (< 2147483647 (+ c_~bag2~0 .cse29 .cse30 .cse33)) (not (<= 0 (+ c_~bag2~0 .cse29 2147483648))) (< 4294967295 .cse29) (not (<= 0 (+ c_~bag2~0 .cse29 .cse30 2147483648)))))))) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse7)) (.cse38 (select .cse36 .cse6))) (let ((.cse39 (+ .cse35 .cse38)) (.cse37 (select .cse36 .cse9)) (.cse34 (select .cse36 .cse8))) (or (< 2147483647 (+ c_~bag2~0 .cse34 .cse35)) (< (select .cse36 .cse3) 4294967296) (not (<= (+ .cse37 .cse38) 2147483647)) (not (<= .cse39 2147483647)) (< (+ c_~bag2~0 .cse34 c_~sum2~0 2147483648) 0) (not (<= 0 (+ .cse37 .cse38 2147483648))) (not (<= (+ c_~bag2~0 .cse34 c_~sum2~0 .cse35 .cse38) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse34 c_~sum2~0 .cse35 .cse38 2147483648))) (< .cse39 (+ c_~bag2~0 .cse34 1)) (not (<= .cse37 4294967295)) (not (<= (+ c_~bag2~0 .cse34 c_~sum2~0 .cse35) 2147483647)) (not (<= 0 (+ 9223372039002259455 .cse34))) (< .cse35 1) (not (<= 0 (+ c_~bag2~0 .cse34 2147483648))) (< 4294967295 .cse34)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse44 (select .cse40 .cse9)) (.cse43 (select .cse40 .cse6)) (.cse41 (select .cse40 .cse8)) (.cse42 (select .cse40 .cse7))) (or (< (select .cse40 .cse3) 4294967296) (not (<= 0 (+ c_~bag2~0 .cse41 .cse42 .cse43 2147483648))) (not (<= (+ c_~bag2~0 .cse41) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse44 .cse41 .cse42 .cse43 2147483648))) (not (<= (+ c_~bag2~0 .cse41 .cse42 .cse43) 2147483647)) (not (<= (+ c_~bag2~0 .cse44 .cse41 .cse42 .cse43) 2147483647)) (not (<= (+ c_~bag2~0 .cse41 .cse42) 2147483647)) (not (<= 0 (+ 9223372039002259455 .cse41))) (not (<= 0 (+ c_~bag2~0 .cse41 2147483648))) (< 4294967295 .cse41) (not (<= 0 (+ c_~bag2~0 .cse41 .cse42 2147483648))))))) .cse17) (or (not (<= c_~bag2~0 4294967295)) (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse46 (select .cse45 .cse7)) (.cse49 (select .cse45 .cse9)) (.cse47 (select .cse45 .cse6)) (.cse48 (select .cse45 .cse8))) (let ((.cse50 (+ c_~bag2~0 .cse48)) (.cse51 (+ .cse49 .cse47 1)) (.cse52 (+ .cse48 .cse46))) (or (< (select .cse45 .cse3) 4294967296) (not (<= (+ .cse46 .cse47) 2147483647)) (< (+ c_~bag2~0 .cse48 c_~sum2~0 2147483648) 0) (< .cse46 (+ .cse49 1)) (not (<= 0 (+ .cse49 .cse47 2147483648))) (not (<= .cse50 2147483647)) (< .cse50 .cse51) (not (<= (+ c_~bag2~0 .cse48 c_~sum2~0 .cse46) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse48 c_~sum2~0 .cse46 2147483648))) (< .cse52 .cse51) (< 2147483647 .cse52) (not (<= .cse48 0))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse55 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse53 (select .cse55 .cse8))) (let ((.cse58 (+ c_~bag2~0 .cse53)) (.cse56 (select .cse55 .cse9)) (.cse54 (select .cse55 .cse7)) (.cse57 (select .cse55 .cse6))) (or (< (+ c_~bag2~0 .cse53 c_~sum2~0 .cse54 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse53 c_~sum2~0 .cse54)) (< (select .cse55 .cse3) 4294967296) (not (<= 0 (+ .cse53 .cse54 2147483648))) (< c_~bag2~0 (+ .cse54 1)) (< (+ .cse53 .cse54) (+ .cse56 1)) (not (<= 0 (+ .cse56 .cse57 2147483648))) (not (<= .cse58 2147483647)) (< .cse58 (+ .cse56 .cse57 1)) (< .cse57 1) (< 2147483647 (+ .cse53 .cse54 .cse57)) (not (<= .cse53 0))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse59 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse64 (select .cse59 .cse8))) (let ((.cse63 (+ c_~bag2~0 .cse64)) (.cse60 (select .cse59 .cse9)) (.cse61 (select .cse59 .cse7)) (.cse62 (select .cse59 .cse6))) (or (< (select .cse59 .cse3) 4294967296) (< (+ .cse60 .cse61 .cse62 2147483648) 0) (< .cse63 (+ .cse61 .cse62 1)) (not (<= .cse63 2147483647)) (< 2147483647 (+ .cse60 .cse61 .cse62)) (<= .cse64 0) (not (<= 0 (+ .cse61 .cse62 2147483648))) (< (+ c_~bag2~0 .cse64 c_~sum2~0 .cse61 .cse62 2147483648) 0) (< .cse64 (+ .cse62 1)) (< 2147483647 (+ .cse64 .cse61)) (< 2147483647 (+ c_~bag2~0 .cse64 c_~sum2~0)) (< 2147483647 (+ c_~bag2~0 .cse64 c_~sum2~0 .cse61 .cse62))))))) .cse10) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse69 (select .cse65 .cse9)) (.cse66 (select .cse65 .cse8)) (.cse67 (select .cse65 .cse7)) (.cse68 (select .cse65 .cse6))) (or (< (select .cse65 .cse3) 4294967296) (not (<= 0 (+ .cse66 .cse67 2147483648))) (< c_~bag2~0 (+ .cse67 1)) (not (<= (+ c_~bag2~0 .cse66) 2147483647)) (<= .cse66 0) (not (<= .cse66 4294967295)) (< c_~bag2~0 (+ .cse67 .cse68 1)) (not (<= 0 (+ .cse66 .cse67 .cse68 2147483648))) (< (+ c_~bag2~0 .cse66 c_~sum2~0 .cse67 .cse68 2147483648) 0) (< (+ .cse69 .cse66 .cse67 .cse68 2147483648) 0) (< 2147483647 (+ .cse69 .cse66 .cse67 .cse68)) (< 2147483647 (+ c_~bag2~0 .cse66 c_~sum2~0 .cse67 .cse68)))))) .cse10) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse70 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse72 (select .cse70 .cse6)) (.cse71 (select .cse70 .cse9)) (.cse74 (select .cse70 .cse8)) (.cse73 (select .cse70 .cse7))) (or (< (select .cse70 .cse3) 4294967296) (not (<= (+ .cse71 .cse72) 2147483647)) (not (<= (+ .cse73 .cse72) 2147483647)) (not (<= 0 (+ .cse71 .cse72 2147483648))) (not (<= (+ c_~bag2~0 .cse74) 2147483647)) (not (<= (+ c_~bag2~0 .cse74 c_~sum2~0 .cse73 .cse72) 2147483647)) (<= .cse74 0) (not (<= 0 (+ .cse73 .cse72 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse74 c_~sum2~0 .cse73 .cse72 2147483648))) (not (<= .cse71 4294967295)) (not (<= (+ c_~bag2~0 .cse74 c_~sum2~0 .cse73) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse74 c_~sum2~0 .cse73 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse74 2147483648))) (< 2147483647 (+ .cse74 .cse73)) (< 2147483647 (+ c_~bag2~0 .cse74 c_~sum2~0)) (< (+ .cse74 .cse73 2147483648) 0))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse75 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse76 (select .cse75 .cse8)) (.cse78 (select .cse75 .cse9)) (.cse77 (select .cse75 .cse7)) (.cse79 (select .cse75 .cse6))) (or (< (select .cse75 .cse3) 4294967296) (not (<= 0 (+ .cse76 .cse77 2147483648))) (not (<= 0 (+ .cse78 .cse76 .cse77 .cse79 2147483648))) (< c_~bag2~0 (+ .cse77 1)) (not (<= (+ c_~bag2~0 .cse76) 2147483647)) (< c_~bag2~0 (+ .cse77 .cse79 1)) (not (<= 0 (+ .cse76 .cse77 .cse79 2147483648))) (not (<= .cse76 0)) (< c_~bag2~0 (+ .cse78 .cse77 .cse79 1)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse80 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse84 (select .cse80 .cse8))) (let ((.cse81 (+ c_~bag2~0 .cse84)) (.cse85 (select .cse80 .cse9)) (.cse83 (select .cse80 .cse6)) (.cse82 (select .cse80 .cse7))) (or (< (select .cse80 .cse3) 4294967296) (< .cse81 (+ .cse82 .cse83 1)) (< (+ c_~bag2~0 .cse84 c_~sum2~0 2147483648) 0) (not (<= .cse81 2147483647)) (not (<= 0 (+ .cse82 .cse83 2147483648))) (< .cse81 (+ .cse85 .cse82 .cse83 1)) (< 4294967295 .cse82) (< .cse84 (+ .cse85 .cse83 1)) (not (<= 0 (+ .cse85 .cse82 .cse83 2147483648))) (< .cse84 (+ .cse83 1)) (< 2147483647 (+ .cse84 .cse82)) (not (<= .cse84 0))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse86 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse90 (select .cse86 .cse8))) (let ((.cse87 (+ c_~bag2~0 .cse90)) (.cse91 (select .cse86 .cse9)) (.cse89 (select .cse86 .cse6)) (.cse88 (select .cse86 .cse7))) (or (< (select .cse86 .cse3) 4294967296) (< .cse87 (+ .cse88 .cse89 1)) (not (<= .cse87 2147483647)) (<= .cse90 0) (not (<= 0 (+ .cse88 .cse89 2147483648))) (< .cse87 (+ .cse91 .cse88 .cse89 1)) (< .cse90 (+ .cse91 .cse89 1)) (not (<= 0 (+ .cse91 .cse88 .cse89 2147483648))) (< .cse90 (+ .cse89 1)) (< 2147483647 (+ .cse90 .cse88)) (< 2147483647 (+ c_~bag2~0 .cse90 c_~sum2~0))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse92 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse93 (select .cse92 .cse8)) (.cse95 (select .cse92 .cse9)) (.cse94 (select .cse92 .cse7)) (.cse96 (select .cse92 .cse6))) (or (< (select .cse92 .cse3) 4294967296) (not (<= 0 (+ .cse93 .cse94 2147483648))) (not (<= 0 (+ .cse95 .cse93 .cse94 .cse96 2147483648))) (< c_~bag2~0 (+ .cse94 1)) (not (<= (+ c_~bag2~0 .cse93) 2147483647)) (<= .cse93 0) (not (<= .cse93 4294967295)) (< c_~bag2~0 (+ .cse94 .cse96 1)) (not (<= 0 (+ .cse93 .cse94 .cse96 2147483648))) (< c_~bag2~0 (+ .cse95 .cse94 .cse96 1)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse99 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse97 (select .cse99 .cse8))) (let ((.cse102 (+ c_~bag2~0 .cse97)) (.cse100 (select .cse99 .cse9)) (.cse98 (select .cse99 .cse7)) (.cse101 (select .cse99 .cse6))) (or (< (+ c_~bag2~0 .cse97 c_~sum2~0 .cse98 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse97 c_~sum2~0 .cse98)) (< (select .cse99 .cse3) 4294967296) (not (<= 0 (+ .cse97 .cse98 2147483648))) (< c_~bag2~0 (+ .cse98 1)) (< (+ .cse97 .cse98) (+ .cse100 1)) (not (<= 0 (+ .cse100 .cse101 2147483648))) (not (<= .cse102 2147483647)) (< .cse102 (+ .cse100 .cse101 1)) (<= .cse97 0) (not (<= .cse97 4294967295)) (< .cse101 1) (< 2147483647 (+ .cse97 .cse98 .cse101))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse103 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse104 (select .cse103 .cse7)) (.cse106 (select .cse103 .cse9)) (.cse105 (select .cse103 .cse6)) (.cse109 (select .cse103 .cse8))) (let ((.cse107 (+ c_~bag2~0 .cse109)) (.cse108 (+ .cse106 .cse105 1)) (.cse110 (+ .cse109 .cse104))) (or (< (select .cse103 .cse3) 4294967296) (not (<= (+ .cse104 .cse105) 2147483647)) (< .cse104 (+ .cse106 1)) (not (<= 0 (+ .cse106 .cse105 2147483648))) (not (<= .cse107 2147483647)) (< .cse107 .cse108) (<= .cse109 0) (not (<= (+ c_~bag2~0 .cse109 c_~sum2~0 .cse104) 2147483647)) (not (<= .cse105 4294967295)) (not (<= 0 (+ c_~bag2~0 .cse109 c_~sum2~0 .cse104 2147483648))) (< .cse110 .cse108) (< 2147483647 .cse110) (< 2147483647 (+ c_~bag2~0 .cse109 c_~sum2~0))))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse111 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse116 (select .cse111 .cse8))) (let ((.cse115 (+ c_~bag2~0 .cse116)) (.cse112 (select .cse111 .cse9)) (.cse113 (select .cse111 .cse7)) (.cse114 (select .cse111 .cse6))) (or (< (select .cse111 .cse3) 4294967296) (< (+ .cse112 .cse113 .cse114 2147483648) 0) (< .cse115 (+ .cse113 .cse114 1)) (< (+ c_~bag2~0 .cse116 c_~sum2~0 2147483648) 0) (not (<= .cse115 2147483647)) (< 2147483647 (+ .cse112 .cse113 .cse114)) (not (<= 0 (+ .cse113 .cse114 2147483648))) (< 4294967295 .cse113) (< (+ c_~bag2~0 .cse116 c_~sum2~0 .cse113 .cse114 2147483648) 0) (< .cse116 (+ .cse114 1)) (< 2147483647 (+ .cse116 .cse113)) (< 2147483647 (+ c_~bag2~0 .cse116 c_~sum2~0 .cse113 .cse114)) (not (<= .cse116 0))))))) .cse10) (or .cse17 (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse119 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse120 (select .cse119 .cse9)) (.cse118 (select .cse119 .cse7)) (.cse121 (select .cse119 .cse6)) (.cse117 (select .cse119 .cse8))) (or (< (+ c_~bag2~0 .cse117 c_~sum2~0 .cse118 2147483648) 0) (< (select .cse119 .cse3) 4294967296) (not (<= 0 (+ .cse117 .cse118 2147483648))) (not (<= (+ .cse120 .cse121) 2147483647)) (< c_~bag2~0 (+ .cse118 1)) (not (<= 0 (+ .cse120 .cse121 2147483648))) (not (<= (+ c_~bag2~0 .cse117) 2147483647)) (not (<= (+ c_~bag2~0 .cse117 c_~sum2~0 .cse118 .cse121) 2147483647)) (< .cse121 1) (< 2147483647 (+ .cse117 .cse118 .cse121)) (not (<= .cse117 0))))))) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse122 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse124 (select .cse122 .cse6)) (.cse123 (select .cse122 .cse9)) (.cse126 (select .cse122 .cse8)) (.cse125 (select .cse122 .cse7))) (or (< (select .cse122 .cse3) 4294967296) (not (<= (+ .cse123 .cse124) 2147483647)) (not (<= (+ .cse125 .cse124) 2147483647)) (< (+ c_~bag2~0 .cse126 c_~sum2~0 2147483648) 0) (not (<= 0 (+ .cse123 .cse124 2147483648))) (not (<= (+ c_~bag2~0 .cse126) 2147483647)) (not (<= (+ c_~bag2~0 .cse126 c_~sum2~0 .cse125 .cse124) 2147483647)) (not (<= 0 (+ .cse125 .cse124 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse126 c_~sum2~0 .cse125 .cse124 2147483648))) (not (<= .cse123 4294967295)) (not (<= (+ c_~bag2~0 .cse126 c_~sum2~0 .cse125) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse126 c_~sum2~0 .cse125 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse126 2147483648))) (< 2147483647 (+ .cse126 .cse125)) (not (<= .cse126 0)) (< (+ .cse126 .cse125 2147483648) 0))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse129 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse130 (select .cse129 .cse9)) (.cse127 (select .cse129 .cse8)) (.cse128 (select .cse129 .cse7)) (.cse131 (select .cse129 .cse6))) (or (< (+ c_~bag2~0 .cse127 c_~sum2~0 .cse128 2147483648) 0) (< (select .cse129 .cse3) 4294967296) (not (<= 0 (+ .cse127 .cse128 2147483648))) (not (<= (+ .cse130 .cse131) 2147483647)) (< c_~bag2~0 (+ .cse128 1)) (not (<= 0 (+ .cse130 .cse131 2147483648))) (not (<= (+ c_~bag2~0 .cse127) 2147483647)) (not (<= (+ c_~bag2~0 .cse127 c_~sum2~0 .cse128 .cse131) 2147483647)) (<= .cse127 0) (not (<= .cse127 4294967295)) (< .cse131 1) (< 2147483647 (+ .cse127 .cse128 .cse131)))))) .cse17) (or (forall ((v_ArrVal_1893 (Array Int Int))) (let ((.cse132 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) c_~A~0.base))) (let ((.cse136 (select .cse132 .cse9)) (.cse134 (select .cse132 .cse7)) (.cse135 (select .cse132 .cse6)) (.cse133 (select .cse132 .cse8))) (or (< (select .cse132 .cse3) 4294967296) (not (<= 0 (+ .cse133 .cse134 2147483648))) (< c_~bag2~0 (+ .cse134 1)) (not (<= (+ c_~bag2~0 .cse133) 2147483647)) (< c_~bag2~0 (+ .cse134 .cse135 1)) (not (<= 0 (+ .cse133 .cse134 .cse135 2147483648))) (< (+ c_~bag2~0 .cse133 c_~sum2~0 .cse134 .cse135 2147483648) 0) (< (+ .cse136 .cse133 .cse134 .cse135 2147483648) 0) (< 2147483647 (+ .cse136 .cse133 .cse134 .cse135)) (< 2147483647 (+ c_~bag2~0 .cse133 c_~sum2~0 .cse134 .cse135)) (not (<= .cse133 0)))))) .cse10)))))) is different from false [2022-11-26 00:43:09,779 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse10 (not (< 4 c_~N~0))) (.cse0 (<= c_~N~0 4)) (.cse6 (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse5 .cse9)) (.cse1 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (select .cse5 .cse8)) (.cse2 (select .cse5 .cse7))) (or (< (+ .cse1 .cse2 2147483648 .cse3) 0) (< (+ .cse1 .cse2 2147483648) 0) (< (+ .cse4 .cse1 .cse2 2147483648 .cse3) 0) (< 0 .cse1) (< 2147483647 (+ .cse4 .cse1 .cse2 .cse3)) (< (select .cse5 .cse6) 4294967296) (< 0 (+ .cse2 1 .cse3)) (< 0 (+ .cse2 1))))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse15 .cse9)) (.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (select .cse15 .cse8)) (.cse12 (select .cse15 .cse7))) (or (< 0 (+ .cse11 .cse12 1 .cse13)) (< (+ .cse14 .cse12 2147483648 .cse13) 0) (< (+ .cse14 .cse12 2147483648) 0) (< (+ .cse11 .cse14 .cse12 2147483648 .cse13) 0) (< 0 .cse14) (< (select .cse15 .cse6) 4294967296) (< 0 (+ .cse12 1 .cse13)) (< 0 (+ .cse12 1))))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse20 .cse9)) (.cse18 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (select .cse20 .cse7)) (.cse17 (select .cse20 .cse8))) (or (< (+ .cse16 2147483648 .cse17) 0) (< .cse18 (+ .cse16 1 .cse17)) (< (+ .cse18 .cse19) (+ .cse16 1)) (< (+ .cse18 .cse19 2147483648) 0) (< 0 .cse18) (< (select .cse20 .cse6) 4294967296) (< 0 (+ .cse19 1)) (< 2147483647 (+ .cse18 .cse19 .cse17)) (< .cse17 1)))))) (or .cse0 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse25 .cse9)) (.cse24 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse25 .cse7)) (.cse23 (select .cse25 .cse8))) (or (< 2147483647 (+ .cse21 .cse22 .cse23)) (< .cse22 1) (< (+ .cse24 .cse22 2147483648 .cse23) 0) (< (+ .cse21 .cse22 2147483648 .cse23) 0) (< (+ .cse24 2147483648) 0) (< .cse24 (+ 1 .cse23)) (< (select .cse25 .cse6) 4294967296) (< 2147483647 (+ .cse24 .cse22)) (< 2147483647 (+ .cse24 .cse22 .cse23)) (< (+ .cse22 2147483648 .cse23) 0)))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse30 .cse9)) (.cse29 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse30 .cse7)) (.cse27 (select .cse30 .cse8))) (or (< (+ .cse26 .cse27) 1) (< (+ .cse28 2147483648 .cse27) 0) (< (+ .cse29 .cse26) (+ .cse28 1)) (< (+ .cse29 2147483648) 0) (< (+ .cse29 .cse26 2147483648) 0) (< (select .cse30 .cse6) 4294967296) (< 2147483647 (+ .cse29 .cse26 .cse27)) (< .cse27 1)))))) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (select .cse35 .cse9)) (.cse34 (select .cse35 .cse7)) (.cse33 (select .cse35 .cse8))) (or (< .cse31 (+ .cse32 1 .cse33)) (< (+ .cse32 .cse34 2147483648 .cse33) 0) (< 2147483647 .cse31) (< .cse31 (+ 1 .cse33)) (< (select .cse35 .cse6) 4294967296) (< 2147483647 (+ .cse31 .cse34)) (<= .cse31 0) (< .cse31 (+ .cse34 1 .cse33)) (< .cse31 (+ .cse32 .cse34 1 .cse33)) (< (+ .cse34 2147483648 .cse33) 0))))) .cse10) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse39 (select .cse40 .cse9)) (.cse36 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse37 (select .cse40 .cse7)) (.cse38 (select .cse40 .cse8))) (or (< (+ .cse36 .cse37 2147483648 .cse38) 0) (< 2147483647 .cse36) (< (+ .cse36 2147483648) 0) (< (+ .cse36 .cse37 2147483648) 0) (< (+ .cse39 .cse36 .cse37 2147483648 .cse38) 0) (< 2147483647 (+ .cse39 .cse36 .cse37 .cse38)) (< (select .cse40 .cse6) 4294967296) (< 2147483647 (+ .cse36 .cse37)) (< 2147483647 (+ .cse36 .cse37 .cse38))))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse41 (select .cse45 .cse9)) (.cse43 (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse44 (select .cse45 .cse7)) (.cse42 (select .cse45 .cse8))) (or (< (+ .cse41 2147483648 .cse42) 0) (< (+ .cse43 .cse44 2147483648) 0) (< 0 .cse43) (< (select .cse45 .cse6) 4294967296) (< 0 (+ .cse44 1)) (< 2147483647 (+ .cse41 .cse42)) (< 2147483647 (+ .cse43 .cse44 .cse42)) (< .cse42 1)))))) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse48 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse49 (select .cse50 .cse7)) (.cse47 (select .cse50 .cse8)) (.cse46 (select .cse50 .cse9))) (or (< (+ .cse46 2147483648 .cse47) 0) (< (+ .cse48 .cse49 2147483648 .cse47) 0) (< 2147483647 (+ .cse49 .cse47)) (< (+ .cse48 2147483648) 0) (< (+ .cse48 .cse49 2147483648) 0) (< 0 .cse48) (< (select .cse50 .cse6) 4294967296) (< 2147483647 (+ .cse48 .cse49)) (< 2147483647 (+ .cse46 .cse47)) (< 4294967295 .cse46))))) .cse10) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse51 (select .cse55 .cse9)) (.cse53 (select .cse55 .cse8)) (.cse52 (select .cse55 .cse7)) (.cse54 (select .cse55 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ .cse51 .cse52 1 .cse53)) (< (+ .cse54 .cse52 2147483648 .cse53) 0) (< 2147483647 .cse54) (< (+ .cse54 .cse52 2147483648) 0) (< (+ .cse51 .cse54 .cse52 2147483648 .cse53) 0) (< (select .cse55 .cse6) 4294967296) (< 0 (+ .cse52 1 .cse53)) (< 0 (+ .cse52 1)) (<= .cse54 0))))) .cse10) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse57 (select .cse60 .cse9)) (.cse59 (select .cse60 .cse7)) (.cse58 (select .cse60 .cse8))) (or (< .cse56 (+ .cse57 1 .cse58)) (< (+ .cse57 .cse59 2147483648 .cse58) 0) (< .cse56 (+ 1 .cse58)) (< 0 .cse56) (< (select .cse60 .cse6) 4294967296) (< 2147483647 (+ .cse56 .cse59)) (< .cse56 (+ .cse59 1 .cse58)) (< .cse56 (+ .cse57 .cse59 1 .cse58)) (< (+ .cse59 2147483648 .cse58) 0)))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse63 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse65 (select .cse67 .cse7)) (.cse61 (select .cse67 .cse9)) (.cse62 (select .cse67 .cse8))) (let ((.cse64 (+ .cse61 1 .cse62)) (.cse66 (+ .cse63 .cse65))) (or (< (+ .cse61 2147483648 .cse62) 0) (< .cse63 .cse64) (< 2147483647 .cse63) (< 4294967295 .cse62) (< 2147483647 (+ .cse65 .cse62)) (< .cse66 .cse64) (< (select .cse67 .cse6) 4294967296) (< .cse65 (+ .cse61 1)) (< 2147483647 .cse66) (<= .cse63 0))))))) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse73 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse68 (select .cse73 .cse7)) (.cse70 (select .cse73 .cse8))) (let ((.cse72 (+ .cse68 .cse70)) (.cse69 (select .cse73 .cse9)) (.cse71 (select .cse73 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse68 1) (< (+ .cse69 2147483648 .cse70) 0) (< (+ .cse71 .cse68 2147483648 .cse70) 0) (< 2147483647 .cse72) (< (+ .cse71 2147483648) 0) (< (select .cse73 .cse6) 4294967296) (< .cse72 (+ .cse71 1)) (< 2147483647 (+ .cse71 .cse68)) (< 2147483647 (+ .cse69 .cse70)) (< 4294967295 .cse69) (< 2147483647 (+ .cse71 .cse68 .cse70))))))) .cse10) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse80 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse76 (select .cse80 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse78 (select .cse80 .cse7)) (.cse74 (select .cse80 .cse9)) (.cse75 (select .cse80 .cse8))) (let ((.cse77 (+ .cse74 1 .cse75)) (.cse79 (+ .cse76 .cse78))) (or (< (+ .cse74 2147483648 .cse75) 0) (< .cse76 .cse77) (< 2147483647 (+ .cse78 .cse75)) (< .cse79 .cse77) (< 0 .cse76) (< (select .cse80 .cse6) 4294967296) (< .cse78 (+ .cse74 1)) (< 2147483647 .cse79))))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse85 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse81 (select .cse85 .cse9)) (.cse83 (select .cse85 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse84 (select .cse85 .cse7)) (.cse82 (select .cse85 .cse8))) (or (< (+ .cse81 2147483648 .cse82) 0) (< 2147483647 .cse83) (< (+ .cse83 .cse84 2147483648) 0) (< (select .cse85 .cse6) 4294967296) (< 2147483647 (+ .cse83 .cse84)) (< 2147483647 (+ .cse81 .cse82)) (< 4294967295 .cse81) (<= .cse83 0) (< 2147483647 (+ .cse83 .cse84 .cse82)) (< (+ .cse84 2147483648 .cse82) 0)))))) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse88 (select .cse90 .cse9)) (.cse89 (select .cse90 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse86 (select .cse90 .cse7)) (.cse87 (select .cse90 .cse8))) (or (< (+ .cse86 .cse87) 1) (< (+ .cse88 2147483648 .cse87) 0) (< (+ .cse89 2147483648) 0) (< (+ .cse89 .cse86 2147483648) 0) (< (select .cse90 .cse6) 4294967296) (< 2147483647 (+ .cse88 .cse87)) (< 2147483647 (+ .cse89 .cse86 .cse87)) (< .cse87 1))))) .cse10) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse95 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse91 (select .cse95 .cse9)) (.cse93 (select .cse95 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse94 (select .cse95 .cse7)) (.cse92 (select .cse95 .cse8))) (or (< (+ .cse91 2147483648 .cse92) 0) (< .cse93 (+ .cse91 1 .cse92)) (< (+ .cse93 .cse94) (+ .cse91 1)) (< 2147483647 .cse93) (< (+ .cse93 .cse94 2147483648) 0) (< (select .cse95 .cse6) 4294967296) (< 0 (+ .cse94 1)) (<= .cse93 0) (< 2147483647 (+ .cse93 .cse94 .cse92)) (< .cse92 1)))))) (or (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse100 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse96 (select .cse100 .cse9)) (.cse98 (select .cse100 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse99 (select .cse100 .cse7)) (.cse97 (select .cse100 .cse8))) (or (< (+ .cse96 2147483648 .cse97) 0) (< 2147483647 .cse98) (< (+ .cse98 .cse99 2147483648) 0) (< (select .cse100 .cse6) 4294967296) (< 0 (+ .cse99 1)) (< 2147483647 (+ .cse96 .cse97)) (<= .cse98 0) (< 2147483647 (+ .cse98 .cse99 .cse97)) (< .cse97 1))))) .cse10) (or .cse0 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse105 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse104 (select .cse105 .cse9)) (.cse103 (select .cse105 .cse8)) (.cse102 (select .cse105 .cse7)) (.cse101 (select .cse105 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse101 .cse102 2147483648 .cse103) 0) (< 2147483647 .cse101) (< (+ .cse101 .cse102 2147483648) 0) (< (+ .cse104 .cse101 .cse102 2147483648 .cse103) 0) (< 2147483647 (+ .cse104 .cse101 .cse102 .cse103)) (< (select .cse105 .cse6) 4294967296) (< 0 (+ .cse102 1 .cse103)) (< 0 (+ .cse102 1)) (<= .cse101 0)))))) (or .cse0 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse110 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse106 (select .cse110 .cse9)) (.cse109 (select .cse110 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse107 (select .cse110 .cse7)) (.cse108 (select .cse110 .cse8))) (or (< 2147483647 (+ .cse106 .cse107 .cse108)) (< (+ .cse106 .cse107 2147483648 .cse108) 0) (< 2147483647 .cse109) (< .cse109 (+ 1 .cse108)) (< (select .cse110 .cse6) 4294967296) (< 2147483647 (+ .cse109 .cse107)) (<= .cse109 0) (< .cse109 (+ .cse107 1 .cse108)) (< 2147483647 (+ .cse109 .cse107 .cse108)) (< (+ .cse107 2147483648 .cse108) 0)))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse115 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse113 (select .cse115 .cse9)) (.cse112 (select .cse115 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse111 (select .cse115 .cse7)) (.cse114 (select .cse115 .cse8))) (or (< .cse111 1) (< .cse112 (+ .cse113 1 .cse114)) (< (+ .cse113 .cse111 2147483648 .cse114) 0) (< (+ .cse112 2147483648) 0) (< .cse112 (+ 1 .cse114)) (< (select .cse115 .cse6) 4294967296) (< 2147483647 (+ .cse112 .cse111)) (< (+ .cse111 2147483648 .cse114) 0)))))) (or .cse10 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse121 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse119 (select .cse121 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse116 (select .cse121 .cse7))) (let ((.cse118 (select .cse121 .cse8)) (.cse117 (select .cse121 .cse9)) (.cse120 (+ .cse119 .cse116))) (or (< .cse116 1) (< (+ .cse117 2147483648 .cse118) 0) (< 2147483647 (+ .cse116 .cse118)) (< (+ .cse119 2147483648) 0) (< .cse120 (+ .cse117 1 .cse118)) (< (select .cse121 .cse6) 4294967296) (< .cse116 (+ .cse117 1)) (< 2147483647 .cse120))))))) (or .cse0 (forall ((v_ArrVal_1893 (Array Int Int)) (v_ArrVal_1892 (Array Int Int))) (let ((.cse126 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1892) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1893) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse122 (select .cse126 .cse9)) (.cse125 (select .cse126 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse123 (select .cse126 .cse7)) (.cse124 (select .cse126 .cse8))) (or (< 2147483647 (+ .cse122 .cse123 .cse124)) (< (+ .cse125 .cse123 2147483648 .cse124) 0) (< (+ .cse122 .cse123 2147483648 .cse124) 0) (< .cse125 (+ 1 .cse124)) (< 0 .cse125) (< (select .cse126 .cse6) 4294967296) (< 2147483647 (+ .cse125 .cse123)) (< .cse125 (+ .cse123 1 .cse124))))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-26 00:43:10,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:10,216 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 10724 treesize of output 5841 [2022-11-26 00:43:10,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:10,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 26372 treesize of output 23058 [2022-11-26 00:43:10,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:10,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 23004 treesize of output 22868 [2022-11-26 00:43:11,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:11,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22868 treesize of output 22596 [2022-11-26 00:43:11,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:11,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22596 treesize of output 22476 [2022-11-26 00:43:12,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22476 treesize of output 22328 [2022-11-26 00:43:12,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:12,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22328 treesize of output 22254 [2022-11-26 00:43:12,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:12,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22254 treesize of output 22106 [2022-11-26 00:43:13,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:13,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 22106 treesize of output 21978 [2022-11-26 00:43:13,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:13,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21978 treesize of output 21858 [2022-11-26 00:43:14,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:14,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21858 treesize of output 21784 [2022-11-26 00:43:14,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:14,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21784 treesize of output 21660 [2022-11-26 00:43:14,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:14,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21660 treesize of output 21598 [2022-11-26 00:43:15,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:15,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21598 treesize of output 21450 [2022-11-26 00:43:15,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:15,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21450 treesize of output 21218 [2022-11-26 00:43:16,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:16,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21218 treesize of output 21122 [2022-11-26 00:43:16,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:16,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21122 treesize of output 20930 [2022-11-26 00:43:16,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:16,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20930 treesize of output 20674 [2022-11-26 00:43:17,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:17,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20674 treesize of output 20574 [2022-11-26 00:43:17,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:17,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20574 treesize of output 20514 [2022-11-26 00:43:18,127 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:18,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20514 treesize of output 20422 [2022-11-26 00:43:18,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:18,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20422 treesize of output 20306 [2022-11-26 00:43:18,918 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:18,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20306 treesize of output 20202 [2022-11-26 00:43:19,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:19,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20202 treesize of output 20150 [2022-11-26 00:43:19,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20150 treesize of output 20042 [2022-11-26 00:43:20,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:20,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20042 treesize of output 19918 [2022-11-26 00:43:20,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:20,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19918 treesize of output 19670 [2022-11-26 00:43:20,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:20,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19670 treesize of output 19430 [2022-11-26 00:43:21,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:21,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19430 treesize of output 19384 [2022-11-26 00:43:21,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:21,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19384 treesize of output 19310 [2022-11-26 00:43:22,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:22,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19310 treesize of output 19260 [2022-11-26 00:43:22,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:22,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19260 treesize of output 19136 [2022-11-26 00:43:22,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:22,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 19136 treesize of output 18888 [2022-11-26 00:43:23,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:23,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18888 treesize of output 18756 [2022-11-26 00:43:23,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:23,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18756 treesize of output 18690 [2022-11-26 00:43:23,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:23,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18690 treesize of output 18574 [2022-11-26 00:43:24,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:24,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18574 treesize of output 18342 [2022-11-26 00:43:24,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:24,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18342 treesize of output 18222 [2022-11-26 00:43:25,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:25,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18222 treesize of output 18162 [2022-11-26 00:43:25,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:25,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18162 treesize of output 18018 [2022-11-26 00:43:25,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:25,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 18018 treesize of output 17946 [2022-11-26 00:43:26,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:26,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17946 treesize of output 17842 [2022-11-26 00:43:26,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:26,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17842 treesize of output 17634 [2022-11-26 00:43:27,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:27,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17634 treesize of output 17418 [2022-11-26 00:43:27,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:27,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17418 treesize of output 17186 [2022-11-26 00:43:27,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:27,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17186 treesize of output 17070 [2022-11-26 00:43:28,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:28,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 17070 treesize of output 16926 [2022-11-26 00:43:28,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:43:28,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 16926 treesize of output 16638 [2022-11-26 00:44:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 00:44:09,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012567223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:09,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202862080] [2022-11-26 00:44:09,310 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-11-26 00:44:09,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:09,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-11-26 00:44:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73074093] [2022-11-26 00:44:09,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:09,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 00:44:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 00:44:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=800, Unknown=2, NotChecked=122, Total=1122 [2022-11-26 00:44:09,312 INFO L87 Difference]: Start difference. First operand 1735 states and 6537 transitions. Second operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:25,662 INFO L93 Difference]: Finished difference Result 2045 states and 7185 transitions. [2022-11-26 00:44:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-26 00:44:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 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 14 [2022-11-26 00:44:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:25,668 INFO L225 Difference]: With dead ends: 2045 [2022-11-26 00:44:25,668 INFO L226 Difference]: Without dead ends: 2023 [2022-11-26 00:44:25,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=562, Invalid=2096, Unknown=2, NotChecked=202, Total=2862 [2022-11-26 00:44:25,669 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1256 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:25,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 0 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1832 Invalid, 0 Unknown, 297 Unchecked, 4.3s Time] [2022-11-26 00:44:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2022-11-26 00:44:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1709. [2022-11-26 00:44:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1670 states have (on average 3.8353293413173652) internal successors, (6405), 1708 states have internal predecessors, (6405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 6405 transitions. [2022-11-26 00:44:25,703 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 6405 transitions. Word has length 14 [2022-11-26 00:44:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:25,703 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 6405 transitions. [2022-11-26 00:44:25,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 6405 transitions. [2022-11-26 00:44:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:44:25,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:25,705 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:44:25,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:25,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:25,905 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:44:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1966571685, now seen corresponding path program 3 times [2022-11-26 00:44:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:25,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686618253] [2022-11-26 00:44:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:26,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686618253] [2022-11-26 00:44:26,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686618253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702297805] [2022-11-26 00:44:26,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:44:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:26,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:26,425 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:26,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-26 00:44:26,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:44:26,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:44:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:44:26,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:27,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:44:27,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:27,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:44:27,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:27,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:44:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:27,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:28,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:28,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-26 00:44:28,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:28,286 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 79 treesize of output 75 [2022-11-26 00:44:28,293 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 60 treesize of output 48 [2022-11-26 00:44:28,301 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 26 treesize of output 20 [2022-11-26 00:44:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:28,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702297805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:28,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [46565876] [2022-11-26 00:44:28,790 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-11-26 00:44:28,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:28,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:44:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625225420] [2022-11-26 00:44:28,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:28,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:44:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:44:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:44:28,792 INFO L87 Difference]: Start difference. First operand 1709 states and 6405 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:41,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:44:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:44,084 INFO L93 Difference]: Finished difference Result 4303 states and 14755 transitions. [2022-11-26 00:44:44,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-26 00:44:44,084 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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 14 [2022-11-26 00:44:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:44,095 INFO L225 Difference]: With dead ends: 4303 [2022-11-26 00:44:44,095 INFO L226 Difference]: Without dead ends: 4303 [2022-11-26 00:44:44,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2164 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1146, Invalid=7405, Unknown=5, NotChecked=0, Total=8556 [2022-11-26 00:44:44,096 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 912 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 146 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:44,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 0 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2518 Invalid, 4 Unknown, 0 Unchecked, 7.1s Time] [2022-11-26 00:44:44,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2022-11-26 00:44:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 2520. [2022-11-26 00:44:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2481 states have (on average 3.9504232164449817) internal successors, (9801), 2519 states have internal predecessors, (9801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 9801 transitions. [2022-11-26 00:44:44,185 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 9801 transitions. Word has length 14 [2022-11-26 00:44:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:44,186 INFO L495 AbstractCegarLoop]: Abstraction has 2520 states and 9801 transitions. [2022-11-26 00:44:44,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 9801 transitions. [2022-11-26 00:44:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:44:44,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:44,188 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:44,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:44,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:44,396 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:44:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:44,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1965029256, now seen corresponding path program 1 times [2022-11-26 00:44:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:44,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010552680] [2022-11-26 00:44:44,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:44,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:45,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:45,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010552680] [2022-11-26 00:44:45,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010552680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:45,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236023914] [2022-11-26 00:44:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:45,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:45,018 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:45,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-26 00:44:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:45,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:44:45,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:45,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:44:45,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:45,741 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 25 treesize of output 24 [2022-11-26 00:44:45,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:45,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:44:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:45,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:44:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:46,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:46,473 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_~i~0_275 Int) (v_ArrVal_1979 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_275 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse0 0)) (< (+ .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-26 00:44:46,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1976 Int) (v_~i~0_275 Int) (v_ArrVal_1979 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1976)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1978) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1979) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse0 (+ (* v_~i~0_275 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse1) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse1))) (not (<= .cse1 0)))))) is different from false [2022-11-26 00:44:46,539 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-26 00:44:46,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 94 [2022-11-26 00:44:46,594 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-26 00:44:46,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 246 [2022-11-26 00:44:46,608 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:44:46,608 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 216 treesize of output 172 [2022-11-26 00:44:46,623 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:44:46,623 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 147 treesize of output 125 [2022-11-26 00:44:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 00:44:46,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236023914] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:46,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [621180726] [2022-11-26 00:44:46,873 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-11-26 00:44:46,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:46,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-11-26 00:44:46,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771931341] [2022-11-26 00:44:46,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:46,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-26 00:44:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:46,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-26 00:44:46,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=524, Unknown=7, NotChecked=94, Total=702 [2022-11-26 00:44:46,875 INFO L87 Difference]: Start difference. First operand 2520 states and 9801 transitions. Second operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 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-11-26 00:44:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:49,126 INFO L93 Difference]: Finished difference Result 3918 states and 13535 transitions. [2022-11-26 00:44:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:44:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 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 14 [2022-11-26 00:44:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:49,137 INFO L225 Difference]: With dead ends: 3918 [2022-11-26 00:44:49,137 INFO L226 Difference]: Without dead ends: 3918 [2022-11-26 00:44:49,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=1177, Unknown=7, NotChecked=146, Total=1560 [2022-11-26 00:44:49,138 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 435 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:49,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 0 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 863 Invalid, 0 Unknown, 276 Unchecked, 1.4s Time] [2022-11-26 00:44:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3918 states. [2022-11-26 00:44:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3918 to 2708. [2022-11-26 00:44:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2669 states have (on average 3.8905957287373547) internal successors, (10384), 2707 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 10384 transitions. [2022-11-26 00:44:49,192 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 10384 transitions. Word has length 14 [2022-11-26 00:44:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:49,193 INFO L495 AbstractCegarLoop]: Abstraction has 2708 states and 10384 transitions. [2022-11-26 00:44:49,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 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-11-26 00:44:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 10384 transitions. [2022-11-26 00:44:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:44:49,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:49,194 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:44:49,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-26 00:44:49,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-11-26 00:44:49,396 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:44:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1965029252, now seen corresponding path program 1 times [2022-11-26 00:44:49,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:49,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358763926] [2022-11-26 00:44:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:49,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358763926] [2022-11-26 00:44:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358763926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639063193] [2022-11-26 00:44:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:49,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:49,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:49,897 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:49,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-26 00:44:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:50,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 00:44:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:50,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:50,627 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 58 treesize of output 58 [2022-11-26 00:44:51,236 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 34 treesize of output 10 [2022-11-26 00:44:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:51,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:51,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:51,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 222 [2022-11-26 00:44:51,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:51,999 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 86 treesize of output 68 [2022-11-26 00:44:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:44:52,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639063193] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:52,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567319892] [2022-11-26 00:44:52,206 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-11-26 00:44:52,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:52,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-11-26 00:44:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411291983] [2022-11-26 00:44:52,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:52,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:44:52,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:44:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2022-11-26 00:44:52,207 INFO L87 Difference]: Start difference. First operand 2708 states and 10384 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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-11-26 00:44:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:44:55,557 INFO L93 Difference]: Finished difference Result 4515 states and 16167 transitions. [2022-11-26 00:44:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:44:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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 14 [2022-11-26 00:44:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:44:55,570 INFO L225 Difference]: With dead ends: 4515 [2022-11-26 00:44:55,570 INFO L226 Difference]: Without dead ends: 4515 [2022-11-26 00:44:55,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=476, Invalid=1415, Unknown=1, NotChecked=0, Total=1892 [2022-11-26 00:44:55,571 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 730 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:44:55,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 0 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-26 00:44:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2022-11-26 00:44:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2415. [2022-11-26 00:44:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2386 states have (on average 3.9471919530595136) internal successors, (9418), 2414 states have internal predecessors, (9418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:44:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 9418 transitions. [2022-11-26 00:44:55,622 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 9418 transitions. Word has length 14 [2022-11-26 00:44:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:44:55,622 INFO L495 AbstractCegarLoop]: Abstraction has 2415 states and 9418 transitions. [2022-11-26 00:44:55,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 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-11-26 00:44:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 9418 transitions. [2022-11-26 00:44:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:44:55,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:44:55,624 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:44:55,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-11-26 00:44:55,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-11-26 00:44:55,824 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:44:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:44:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -448061019, now seen corresponding path program 4 times [2022-11-26 00:44:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:44:55,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956554306] [2022-11-26 00:44:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:44:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:44:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:56,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:44:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956554306] [2022-11-26 00:44:56,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956554306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:44:56,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911211075] [2022-11-26 00:44:56,392 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:44:56,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:44:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:44:56,393 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:44:56,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-26 00:44:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:44:56,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 00:44:56,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:44:57,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:44:57,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:57,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:44:57,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:44:57,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:44:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:44:57,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:44:57,642 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2060 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2060) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4) 4)) 4294967296)) is different from false [2022-11-26 00:44:57,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:57,932 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 27 treesize of output 28 [2022-11-26 00:44:57,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:44:57,943 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 71 treesize of output 67 [2022-11-26 00:44:57,947 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 54 treesize of output 46 [2022-11-26 00:44:57,952 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 24 treesize of output 20 [2022-11-26 00:44:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:44:58,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911211075] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:44:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882757715] [2022-11-26 00:44:58,200 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-11-26 00:44:58,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:44:58,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:44:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846320770] [2022-11-26 00:44:58,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:44:58,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:44:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:44:58,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:44:58,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=832, Unknown=18, NotChecked=58, Total=992 [2022-11-26 00:44:58,201 INFO L87 Difference]: Start difference. First operand 2415 states and 9418 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:01,226 INFO L93 Difference]: Finished difference Result 4017 states and 14336 transitions. [2022-11-26 00:45:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:45:01,227 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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 14 [2022-11-26 00:45:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:01,236 INFO L225 Difference]: With dead ends: 4017 [2022-11-26 00:45:01,236 INFO L226 Difference]: Without dead ends: 4017 [2022-11-26 00:45:01,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=211, Invalid=1667, Unknown=18, NotChecked=84, Total=1980 [2022-11-26 00:45:01,237 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 414 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:01,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 0 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1546 Invalid, 0 Unknown, 117 Unchecked, 1.8s Time] [2022-11-26 00:45:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4017 states. [2022-11-26 00:45:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4017 to 2548. [2022-11-26 00:45:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 2519 states have (on average 3.9833267169511712) internal successors, (10034), 2547 states have internal predecessors, (10034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 10034 transitions. [2022-11-26 00:45:01,288 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 10034 transitions. Word has length 14 [2022-11-26 00:45:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:01,288 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 10034 transitions. [2022-11-26 00:45:01,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 10034 transitions. [2022-11-26 00:45:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:45:01,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:01,290 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:45:01,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-11-26 00:45:01,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:45:01,499 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:45:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:01,499 INFO L85 PathProgramCache]: Analyzing trace with hash -440231349, now seen corresponding path program 5 times [2022-11-26 00:45:01,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534469917] [2022-11-26 00:45:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:01,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534469917] [2022-11-26 00:45:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534469917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:45:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864840955] [2022-11-26 00:45:01,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:45:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:45:01,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:45:01,990 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:45:01,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-26 00:45:02,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:45:02,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:45:02,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-26 00:45:02,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:45:02,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-26 00:45:02,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:02,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:45:03,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:03,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-26 00:45:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:03,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:45:03,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:45:03,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-26 00:45:03,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:45:03,975 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 157 treesize of output 145 [2022-11-26 00:45:03,982 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 130 treesize of output 106 [2022-11-26 00:45:03,988 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 106 treesize of output 94 [2022-11-26 00:45:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864840955] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:45:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431805267] [2022-11-26 00:45:04,454 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-11-26 00:45:04,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:45:04,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-26 00:45:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781184153] [2022-11-26 00:45:04,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:45:04,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:45:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:45:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:45:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=889, Unknown=1, NotChecked=0, Total=992 [2022-11-26 00:45:04,457 INFO L87 Difference]: Start difference. First operand 2548 states and 10034 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:45:15,814 INFO L93 Difference]: Finished difference Result 4013 states and 14281 transitions. [2022-11-26 00:45:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-26 00:45:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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 14 [2022-11-26 00:45:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:45:15,824 INFO L225 Difference]: With dead ends: 4013 [2022-11-26 00:45:15,824 INFO L226 Difference]: Without dead ends: 4013 [2022-11-26 00:45:15,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=665, Invalid=4588, Unknown=3, NotChecked=0, Total=5256 [2022-11-26 00:45:15,825 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 902 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 172 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:45:15,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 0 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2148 Invalid, 7 Unknown, 0 Unchecked, 4.5s Time] [2022-11-26 00:45:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2022-11-26 00:45:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 2180. [2022-11-26 00:45:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2151 states have (on average 3.9632728963272896) internal successors, (8525), 2179 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 8525 transitions. [2022-11-26 00:45:15,874 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 8525 transitions. Word has length 14 [2022-11-26 00:45:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:45:15,874 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 8525 transitions. [2022-11-26 00:45:15,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:45:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 8525 transitions. [2022-11-26 00:45:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:45:15,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:45:15,876 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:45:15,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-26 00:45:16,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-11-26 00:45:16,085 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-11-26 00:45:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:45:16,085 INFO L85 PathProgramCache]: Analyzing trace with hash -639564270, now seen corresponding path program 2 times [2022-11-26 00:45:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:45:16,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202649327] [2022-11-26 00:45:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:45:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:45:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:45:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:16,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:45:16,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202649327] [2022-11-26 00:45:16,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202649327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:45:16,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313254334] [2022-11-26 00:45:16,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:45:16,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:45:16,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:45:16,743 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:45:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_79e3fe2a-ba6f-4b36-84b5-88d29a995b9e/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-26 00:45:17,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:45:17,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:45:17,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 00:45:17,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:45:17,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 13 treesize of output 9 [2022-11-26 00:45:17,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:17,494 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 25 treesize of output 24 [2022-11-26 00:45:17,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:17,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:45:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:45:17,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-26 00:45:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:45:17,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:45:20,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_~i~0_286 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2146) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* v_~i~0_286 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ .cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2147483648) (not (<= .cse0 0)) (not (<= 0 (+ 9223372039002259455 .cse0))))))) is different from false [2022-11-26 00:45:20,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2143 Int) (v_ArrVal_2146 (Array Int Int)) (v_ArrVal_2145 (Array Int Int)) (v_~i~0_286 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2143)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2145) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2146) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse0 (+ (* v_~i~0_286 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse1) 2147483648) (not (<= 0 (+ 9223372039002259455 .cse1))) (not (<= .cse1 0)))))) is different from false [2022-11-26 00:45:20,406 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-26 00:45:20,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 94 [2022-11-26 00:45:20,450 INFO L321 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2022-11-26 00:45:20,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 533 treesize of output 492 [2022-11-26 00:45:20,467 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 00:45:20,467 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 462 treesize of output 374