./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI --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 d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:04:32,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:04:32,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:04:32,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:04:32,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:04:32,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:04:32,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:04:32,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:04:32,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:04:32,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:04:32,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:04:32,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:04:32,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:04:32,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:04:32,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:04:32,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:04:32,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:04:32,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:04:32,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:04:32,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:04:32,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:04:32,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:04:32,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:04:32,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:04:32,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:04:32,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:04:32,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:04:32,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:04:32,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:04:32,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:04:32,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:04:32,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:04:32,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:04:32,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:04:32,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:04:32,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:04:32,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:04:32,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:04:32,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:04:32,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:04:32,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:04:32,442 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 04:04:32,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:04:32,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:04:32,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:04:32,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:04:32,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:04:32,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:04:32,471 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:04:32,471 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:04:32,471 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:04:32,472 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:04:32,472 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:04:32,472 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:04:32,473 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:04:32,473 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:04:32,473 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:04:32,474 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:04:32,474 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:04:32,474 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:04:32,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:04:32,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:04:32,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 04:04:32,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:04:32,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:04:32,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:04:32,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:04:32,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:04:32,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:04:32,478 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 04:04:32,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:04:32,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:04:32,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:04:32,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:04:32,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:04:32,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:04:32,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:04:32,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:04:32,481 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:04:32,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:04:32,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:04:32,482 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:04:32,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:04:32,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:04:32,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:04:32,483 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_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 [2022-11-03 04:04:32,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:04:32,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:04:32,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:04:32,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:04:32,913 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:04:32,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-03 04:04:33,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/data/c0ea501a5/4a55130ac3374c51801e2c9506a1d2bb/FLAG6eb42b4c5 [2022-11-03 04:04:33,565 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:04:33,565 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-03 04:04:33,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/data/c0ea501a5/4a55130ac3374c51801e2c9506a1d2bb/FLAG6eb42b4c5 [2022-11-03 04:04:33,920 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/data/c0ea501a5/4a55130ac3374c51801e2c9506a1d2bb [2022-11-03 04:04:33,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:04:33,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:04:33,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:04:33,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:04:33,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:04:33,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:33" (1/1) ... [2022-11-03 04:04:33,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cfb004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:33, skipping insertion in model container [2022-11-03 04:04:33,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:04:33" (1/1) ... [2022-11-03 04:04:33,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:04:33,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:04:34,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-03 04:04:34,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:04:34,256 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:04:34,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-03 04:04:34,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:04:34,310 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:04:34,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34 WrapperNode [2022-11-03 04:04:34,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:04:34,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:04:34,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:04:34,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:04:34,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,372 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 297 [2022-11-03 04:04:34,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:04:34,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:04:34,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:04:34,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:04:34,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:04:34,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:04:34,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:04:34,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:04:34,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (1/1) ... [2022-11-03 04:04:34,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:04:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:34,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:04:34,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:04:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:04:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:04:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 04:04:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 04:04:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 04:04:34,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 04:04:34,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 04:04:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 04:04:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 04:04:34,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 04:04:34,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-03 04:04:34,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-03 04:04:34,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:04:34,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 04:04:34,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 04:04:34,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:04:34,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:04:34,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:04:34,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:04:34,528 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 04:04:34,715 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:04:34,717 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:04:35,427 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:04:36,015 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:04:36,016 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 04:04:36,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:36 BoogieIcfgContainer [2022-11-03 04:04:36,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:04:36,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:04:36,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:04:36,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:04:36,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:04:33" (1/3) ... [2022-11-03 04:04:36,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b518ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:36, skipping insertion in model container [2022-11-03 04:04:36,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:04:34" (2/3) ... [2022-11-03 04:04:36,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b518ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:04:36, skipping insertion in model container [2022-11-03 04:04:36,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:04:36" (3/3) ... [2022-11-03 04:04:36,040 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-11-03 04:04:36,052 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 04:04:36,064 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:04:36,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-03 04:04:36,065 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 04:04:36,270 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-11-03 04:04:36,359 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 04:04:36,380 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 236 transitions, 516 flow [2022-11-03 04:04:36,386 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 236 transitions, 516 flow [2022-11-03 04:04:36,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 236 transitions, 516 flow [2022-11-03 04:04:36,566 INFO L130 PetriNetUnfolder]: 14/221 cut-off events. [2022-11-03 04:04:36,566 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-03 04:04:36,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 221 events. 14/221 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 325 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 186. Up to 3 conditions per place. [2022-11-03 04:04:36,580 INFO L118 LiptonReduction]: Number of co-enabled transitions 5092 [2022-11-03 04:04:54,811 INFO L133 LiptonReduction]: Checked pairs total: 20913 [2022-11-03 04:04:54,811 INFO L135 LiptonReduction]: Total number of compositions: 229 [2022-11-03 04:04:54,821 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 76 transitions, 196 flow [2022-11-03 04:04:55,206 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:55,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:04:55,235 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;@3a52df0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:04:55,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-11-03 04:04:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 04:04:55,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:55,273 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 04:04:55,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:04:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1393, now seen corresponding path program 1 times [2022-11-03 04:04:55,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:55,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805482353] [2022-11-03 04:04:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:55,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:55,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805482353] [2022-11-03 04:04:55,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805482353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:55,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 04:04:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863524374] [2022-11-03 04:04:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:55,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 04:04:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 04:04:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 04:04:55,519 INFO L87 Difference]: Start difference. First operand has 8487 states, 7755 states have (on average 4.162733720180529) internal successors, (32282), 8486 states have internal predecessors, (32282), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:55,761 INFO L93 Difference]: Finished difference Result 5109 states and 19230 transitions. [2022-11-03 04:04:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 04:04:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-03 04:04:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:55,839 INFO L225 Difference]: With dead ends: 5109 [2022-11-03 04:04:55,839 INFO L226 Difference]: Without dead ends: 5109 [2022-11-03 04:04:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 04:04:55,846 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:55,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:04:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5109 states. [2022-11-03 04:04:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5109 to 5109. [2022-11-03 04:04:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4765 states have (on average 4.035676810073452) internal successors, (19230), 5108 states have internal predecessors, (19230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 19230 transitions. [2022-11-03 04:04:56,313 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 19230 transitions. Word has length 1 [2022-11-03 04:04:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:56,314 INFO L495 AbstractCegarLoop]: Abstraction has 5109 states and 19230 transitions. [2022-11-03 04:04:56,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 19230 transitions. [2022-11-03 04:04:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 04:04:56,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:56,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 04:04:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:04:56,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:04:56,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash 44579, now seen corresponding path program 1 times [2022-11-03 04:04:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:56,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706132669] [2022-11-03 04:04:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:56,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:56,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706132669] [2022-11-03 04:04:56,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706132669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:04:56,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:04:56,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:04:56,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688258512] [2022-11-03 04:04:56,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:04:56,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:04:56,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:04:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:04:56,590 INFO L87 Difference]: Start difference. First operand 5109 states and 19230 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-03 04:04:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:56,920 INFO L93 Difference]: Finished difference Result 10215 states and 38457 transitions. [2022-11-03 04:04:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:04:56,920 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-03 04:04:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:57,092 INFO L225 Difference]: With dead ends: 10215 [2022-11-03 04:04:57,098 INFO L226 Difference]: Without dead ends: 10215 [2022-11-03 04:04:57,098 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-03 04:04:57,100 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:57,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:04:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2022-11-03 04:04:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 5110. [2022-11-03 04:04:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 4766 states have (on average 4.035249685270667) internal successors, (19232), 5109 states have internal predecessors, (19232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 19232 transitions. [2022-11-03 04:04:57,468 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 19232 transitions. Word has length 2 [2022-11-03 04:04:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:57,469 INFO L495 AbstractCegarLoop]: Abstraction has 5110 states and 19232 transitions. [2022-11-03 04:04:57,469 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-03 04:04:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 19232 transitions. [2022-11-03 04:04:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 04:04:57,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:57,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 04:04:57,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:04:57,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:04:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:57,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1384523, now seen corresponding path program 1 times [2022-11-03 04:04:57,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:57,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530546345] [2022-11-03 04:04:57,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:57,637 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-03 04:04:57,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530546345] [2022-11-03 04:04:57,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530546345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288229034] [2022-11-03 04:04:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:57,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:57,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:04:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:57,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:04:57,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:57,839 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-03 04:04:57,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:57,856 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-03 04:04:57,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288229034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:57,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [83839515] [2022-11-03 04:04:57,866 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:04:57,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:57,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-03 04:04:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166738072] [2022-11-03 04:04:57,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:04:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:04:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:57,869 INFO L87 Difference]: Start difference. First operand 5110 states and 19232 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-03 04:04:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:58,869 INFO L93 Difference]: Finished difference Result 25533 states and 96141 transitions. [2022-11-03 04:04:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:04:58,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 3 [2022-11-03 04:04:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:59,068 INFO L225 Difference]: With dead ends: 25533 [2022-11-03 04:04:59,068 INFO L226 Difference]: Without dead ends: 25533 [2022-11-03 04:04:59,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:04:59,072 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 266 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:59,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 54 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:04:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2022-11-03 04:04:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 5113. [2022-11-03 04:04:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5113 states, 4769 states have (on average 4.034598448312015) internal successors, (19241), 5112 states have internal predecessors, (19241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5113 states to 5113 states and 19241 transitions. [2022-11-03 04:04:59,850 INFO L78 Accepts]: Start accepts. Automaton has 5113 states and 19241 transitions. Word has length 3 [2022-11-03 04:04:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:59,850 INFO L495 AbstractCegarLoop]: Abstraction has 5113 states and 19241 transitions. [2022-11-03 04:04:59,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-03 04:04:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5113 states and 19241 transitions. [2022-11-03 04:04:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 04:04:59,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:59,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 04:05:00,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:00,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:00,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:00,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1384563, now seen corresponding path program 1 times [2022-11-03 04:05:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:00,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376129492] [2022-11-03 04:05:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:00,263 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-03 04:05:00,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:00,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376129492] [2022-11-03 04:05:00,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376129492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:00,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617279529] [2022-11-03 04:05:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:00,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:00,279 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:00,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:05:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:00,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:05:00,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:00,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:05:00,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617279529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:00,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:05:00,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-03 04:05:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664954383] [2022-11-03 04:05:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:00,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:05:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:00,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:05:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:00,504 INFO L87 Difference]: Start difference. First operand 5113 states and 19241 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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-03 04:05:00,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:00,805 INFO L93 Difference]: Finished difference Result 10217 states and 38462 transitions. [2022-11-03 04:05:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:05:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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 3 [2022-11-03 04:05:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:00,879 INFO L225 Difference]: With dead ends: 10217 [2022-11-03 04:05:00,880 INFO L226 Difference]: Without dead ends: 10217 [2022-11-03 04:05:00,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:00,881 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 107 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:00,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 27 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:05:00,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2022-11-03 04:05:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 5112. [2022-11-03 04:05:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 4769 states have (on average 4.033759698049906) internal successors, (19237), 5111 states have internal predecessors, (19237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 19237 transitions. [2022-11-03 04:05:01,249 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 19237 transitions. Word has length 3 [2022-11-03 04:05:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:01,250 INFO L495 AbstractCegarLoop]: Abstraction has 5112 states and 19237 transitions. [2022-11-03 04:05:01,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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-03 04:05:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 19237 transitions. [2022-11-03 04:05:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 04:05:01,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:01,251 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-03 04:05:01,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 04:05:01,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:01,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:01,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1700792285, now seen corresponding path program 2 times [2022-11-03 04:05:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:01,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038535453] [2022-11-03 04:05:01,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,597 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-03 04:05:01,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:01,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038535453] [2022-11-03 04:05:01,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038535453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:01,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873244110] [2022-11-03 04:05:01,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:01,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:01,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:01,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:01,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:05:01,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 04:05:01,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:01,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:05:01,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:01,792 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-03 04:05:01,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:05:01,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873244110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:01,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:05:01,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 04:05:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499909820] [2022-11-03 04:05:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:01,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:05:01,795 INFO L87 Difference]: Start difference. First operand 5112 states and 19237 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-03 04:05:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:01,940 INFO L93 Difference]: Finished difference Result 5111 states and 19236 transitions. [2022-11-03 04:05:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:01,940 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-03 04:05:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,073 INFO L225 Difference]: With dead ends: 5111 [2022-11-03 04:05:02,073 INFO L226 Difference]: Without dead ends: 5111 [2022-11-03 04:05:02,073 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-03 04:05:02,074 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2022-11-03 04:05:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 5107. [2022-11-03 04:05:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5107 states, 4765 states have (on average 4.035257082896117) internal successors, (19228), 5106 states have internal predecessors, (19228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5107 states to 5107 states and 19228 transitions. [2022-11-03 04:05:02,235 INFO L78 Accepts]: Start accepts. Automaton has 5107 states and 19228 transitions. Word has length 6 [2022-11-03 04:05:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:02,235 INFO L495 AbstractCegarLoop]: Abstraction has 5107 states and 19228 transitions. [2022-11-03 04:05:02,235 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-03 04:05:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5107 states and 19228 transitions. [2022-11-03 04:05:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:05:02,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:02,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:02,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:02,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1406889304, now seen corresponding path program 1 times [2022-11-03 04:05:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409677912] [2022-11-03 04:05:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:02,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:02,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409677912] [2022-11-03 04:05:02,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409677912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:02,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:02,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:02,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880561894] [2022-11-03 04:05:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:02,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:02,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:02,521 INFO L87 Difference]: Start difference. First operand 5107 states and 19228 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-03 04:05:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:02,699 INFO L93 Difference]: Finished difference Result 5657 states and 21827 transitions. [2022-11-03 04:05:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:02,700 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-03 04:05:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:02,732 INFO L225 Difference]: With dead ends: 5657 [2022-11-03 04:05:02,732 INFO L226 Difference]: Without dead ends: 5657 [2022-11-03 04:05:02,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:02,735 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2022-11-03 04:05:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5481. [2022-11-03 04:05:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 5139 states have (on average 4.162482973341117) internal successors, (21391), 5480 states have internal predecessors, (21391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 21391 transitions. [2022-11-03 04:05:03,021 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 21391 transitions. Word has length 8 [2022-11-03 04:05:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:03,022 INFO L495 AbstractCegarLoop]: Abstraction has 5481 states and 21391 transitions. [2022-11-03 04:05:03,022 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-03 04:05:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 21391 transitions. [2022-11-03 04:05:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 04:05:03,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:03,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:03,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:05:03,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1406889305, now seen corresponding path program 1 times [2022-11-03 04:05:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988512131] [2022-11-03 04:05:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:03,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:03,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988512131] [2022-11-03 04:05:03,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988512131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:03,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:03,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335592588] [2022-11-03 04:05:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:03,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:05:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:03,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:05:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:03,183 INFO L87 Difference]: Start difference. First operand 5481 states and 21391 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-03 04:05:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:03,657 INFO L93 Difference]: Finished difference Result 6061 states and 23038 transitions. [2022-11-03 04:05:03,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:05:03,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-03 04:05:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:03,693 INFO L225 Difference]: With dead ends: 6061 [2022-11-03 04:05:03,693 INFO L226 Difference]: Without dead ends: 6019 [2022-11-03 04:05:03,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:05:03,695 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:03,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:05:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2022-11-03 04:05:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 5929. [2022-11-03 04:05:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5929 states, 5587 states have (on average 4.077501342402004) internal successors, (22781), 5928 states have internal predecessors, (22781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 22781 transitions. [2022-11-03 04:05:03,953 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 22781 transitions. Word has length 8 [2022-11-03 04:05:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:03,953 INFO L495 AbstractCegarLoop]: Abstraction has 5929 states and 22781 transitions. [2022-11-03 04:05:03,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-03 04:05:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 22781 transitions. [2022-11-03 04:05:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:05:03,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:03,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:03,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 04:05:03,956 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1085562495, now seen corresponding path program 1 times [2022-11-03 04:05:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:03,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726281711] [2022-11-03 04:05:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:04,261 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-03 04:05:04,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:04,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726281711] [2022-11-03 04:05:04,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726281711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:04,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512419959] [2022-11-03 04:05:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:04,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:04,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:04,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:04,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:05:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:04,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 04:05:04,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:04,527 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-03 04:05:04,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:04,603 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-03 04:05:04,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512419959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1099422593] [2022-11-03 04:05:04,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:04,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:04,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-03 04:05:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196086098] [2022-11-03 04:05:04,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:05:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:05:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:05:04,610 INFO L87 Difference]: Start difference. First operand 5929 states and 22781 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-03 04:05:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:05,180 INFO L93 Difference]: Finished difference Result 6599 states and 23336 transitions. [2022-11-03 04:05:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:05:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-03 04:05:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:05,219 INFO L225 Difference]: With dead ends: 6599 [2022-11-03 04:05:05,219 INFO L226 Difference]: Without dead ends: 6513 [2022-11-03 04:05:05,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-11-03 04:05:05,221 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 397 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:05,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 67 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:05:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2022-11-03 04:05:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5556. [2022-11-03 04:05:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5556 states, 5214 states have (on average 3.9367088607594938) internal successors, (20526), 5555 states have internal predecessors, (20526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5556 states to 5556 states and 20526 transitions. [2022-11-03 04:05:05,590 INFO L78 Accepts]: Start accepts. Automaton has 5556 states and 20526 transitions. Word has length 9 [2022-11-03 04:05:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:05,590 INFO L495 AbstractCegarLoop]: Abstraction has 5556 states and 20526 transitions. [2022-11-03 04:05:05,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-03 04:05:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5556 states and 20526 transitions. [2022-11-03 04:05:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:05:05,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:05,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:05,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:05,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 04:05:05,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:05,794 INFO L85 PathProgramCache]: Analyzing trace with hash -524747990, now seen corresponding path program 1 times [2022-11-03 04:05:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:05,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801407812] [2022-11-03 04:05:05,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:05,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:05,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:05,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801407812] [2022-11-03 04:05:05,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801407812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:05,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:05,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163352895] [2022-11-03 04:05:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:05,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:05,873 INFO L87 Difference]: Start difference. First operand 5556 states and 20526 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-03 04:05:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:06,098 INFO L93 Difference]: Finished difference Result 8504 states and 31764 transitions. [2022-11-03 04:05:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:06,099 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 9 [2022-11-03 04:05:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:06,146 INFO L225 Difference]: With dead ends: 8504 [2022-11-03 04:05:06,147 INFO L226 Difference]: Without dead ends: 8504 [2022-11-03 04:05:06,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:06,148 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:06,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:05:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2022-11-03 04:05:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 6094. [2022-11-03 04:05:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 5752 states have (on average 4.355180806675939) internal successors, (25051), 6093 states have internal predecessors, (25051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 25051 transitions. [2022-11-03 04:05:06,554 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 25051 transitions. Word has length 9 [2022-11-03 04:05:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:06,554 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 25051 transitions. [2022-11-03 04:05:06,555 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-03 04:05:06,555 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 25051 transitions. [2022-11-03 04:05:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:05:06,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:06,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:06,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 04:05:06,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -524747988, now seen corresponding path program 1 times [2022-11-03 04:05:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720060703] [2022-11-03 04:05:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:06,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720060703] [2022-11-03 04:05:06,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720060703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:06,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:06,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:05:06,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708577690] [2022-11-03 04:05:06,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:06,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:05:06,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:06,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:05:06,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:05:06,917 INFO L87 Difference]: Start difference. First operand 6094 states and 25051 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-03 04:05:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:07,353 INFO L93 Difference]: Finished difference Result 6331 states and 25634 transitions. [2022-11-03 04:05:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:05:07,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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 9 [2022-11-03 04:05:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:07,486 INFO L225 Difference]: With dead ends: 6331 [2022-11-03 04:05:07,486 INFO L226 Difference]: Without dead ends: 6094 [2022-11-03 04:05:07,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:05:07,487 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:07,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 55 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:05:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2022-11-03 04:05:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 6094. [2022-11-03 04:05:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 5752 states have (on average 4.355006954102921) internal successors, (25050), 6093 states have internal predecessors, (25050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 25050 transitions. [2022-11-03 04:05:07,752 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 25050 transitions. Word has length 9 [2022-11-03 04:05:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:07,753 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 25050 transitions. [2022-11-03 04:05:07,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-03 04:05:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 25050 transitions. [2022-11-03 04:05:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:05:07,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:07,754 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:07,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 04:05:07,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1042156967, now seen corresponding path program 2 times [2022-11-03 04:05:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228763923] [2022-11-03 04:05:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:05:07,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:07,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228763923] [2022-11-03 04:05:07,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228763923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:07,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:07,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857666649] [2022-11-03 04:05:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:07,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:07,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:07,951 INFO L87 Difference]: Start difference. First operand 6094 states and 25050 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-03 04:05:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:08,310 INFO L93 Difference]: Finished difference Result 8618 states and 34877 transitions. [2022-11-03 04:05:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:08,311 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 10 [2022-11-03 04:05:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:08,346 INFO L225 Difference]: With dead ends: 8618 [2022-11-03 04:05:08,346 INFO L226 Difference]: Without dead ends: 8618 [2022-11-03 04:05:08,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:08,347 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:08,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8618 states. [2022-11-03 04:05:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8618 to 6670. [2022-11-03 04:05:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6328 states have (on average 4.4061314791403285) internal successors, (27882), 6669 states have internal predecessors, (27882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27882 transitions. [2022-11-03 04:05:08,610 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27882 transitions. Word has length 10 [2022-11-03 04:05:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:08,610 INFO L495 AbstractCegarLoop]: Abstraction has 6670 states and 27882 transitions. [2022-11-03 04:05:08,610 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-03 04:05:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27882 transitions. [2022-11-03 04:05:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:05:08,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:08,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:08,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 04:05:08,612 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash -481342460, now seen corresponding path program 1 times [2022-11-03 04:05:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:08,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729334340] [2022-11-03 04:05:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:08,859 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-03 04:05:08,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729334340] [2022-11-03 04:05:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729334340] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855607484] [2022-11-03 04:05:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:08,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:08,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:08,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:05:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:09,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:05:09,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:09,113 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-03 04:05:09,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:09,193 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-03 04:05:09,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855607484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:09,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1081593134] [2022-11-03 04:05:09,195 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:09,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-03 04:05:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328870553] [2022-11-03 04:05:09,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:09,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:05:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:05:09,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:05:09,202 INFO L87 Difference]: Start difference. First operand 6670 states and 27882 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) 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-03 04:05:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:09,747 INFO L93 Difference]: Finished difference Result 6510 states and 26945 transitions. [2022-11-03 04:05:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) 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 10 [2022-11-03 04:05:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:09,778 INFO L225 Difference]: With dead ends: 6510 [2022-11-03 04:05:09,779 INFO L226 Difference]: Without dead ends: 6273 [2022-11-03 04:05:09,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:05:09,780 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 163 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:09,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 116 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:05:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2022-11-03 04:05:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6273. [2022-11-03 04:05:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 5931 states have (on average 4.444613050075873) internal successors, (26361), 6272 states have internal predecessors, (26361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 26361 transitions. [2022-11-03 04:05:10,124 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 26361 transitions. Word has length 10 [2022-11-03 04:05:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:10,124 INFO L495 AbstractCegarLoop]: Abstraction has 6273 states and 26361 transitions. [2022-11-03 04:05:10,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) 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-03 04:05:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 26361 transitions. [2022-11-03 04:05:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:10,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:10,125 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:10,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 04:05:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:10,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 864228908, now seen corresponding path program 2 times [2022-11-03 04:05:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111970677] [2022-11-03 04:05:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:10,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111970677] [2022-11-03 04:05:10,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111970677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:10,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297517051] [2022-11-03 04:05:10,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:10,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:10,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:10,753 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:10,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:05:10,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:05:10,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:10,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 04:05:10,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:11,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-11-03 04:05:11,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:11,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:11,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:11,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:11,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_295 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_295) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-11-03 04:05:11,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_295) |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-03 04:05:11,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:11,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:05:11,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:11,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-03 04:05:11,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:11,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:05:11,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297517051] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212333660] [2022-11-03 04:05:11,614 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:11,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:11,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 04:05:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506218627] [2022-11-03 04:05:11,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:11,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:05:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:05:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=254, Unknown=2, NotChecked=66, Total=380 [2022-11-03 04:05:11,619 INFO L87 Difference]: Start difference. First operand 6273 states and 26361 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:12,258 INFO L93 Difference]: Finished difference Result 6353 states and 26559 transitions. [2022-11-03 04:05:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:12,296 INFO L225 Difference]: With dead ends: 6353 [2022-11-03 04:05:12,297 INFO L226 Difference]: Without dead ends: 6353 [2022-11-03 04:05:12,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=386, Unknown=2, NotChecked=82, Total=552 [2022-11-03 04:05:12,298 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:12,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 132 Unchecked, 0.4s Time] [2022-11-03 04:05:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2022-11-03 04:05:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6299. [2022-11-03 04:05:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5957 states have (on average 4.436797045492698) internal successors, (26430), 6298 states have internal predecessors, (26430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 26430 transitions. [2022-11-03 04:05:12,597 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 26430 transitions. Word has length 11 [2022-11-03 04:05:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:12,598 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 26430 transitions. [2022-11-03 04:05:12,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 26430 transitions. [2022-11-03 04:05:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:12,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:12,599 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:12,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:12,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:12,806 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash 864228912, now seen corresponding path program 1 times [2022-11-03 04:05:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62865426] [2022-11-03 04:05:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:13,552 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:13,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62865426] [2022-11-03 04:05:13,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62865426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:13,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221983512] [2022-11-03 04:05:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:13,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:13,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:13,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:13,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:05:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:13,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 04:05:13,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:13,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:13,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:13,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:13,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:13,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:13,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:14,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_333) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-03 04:05:14,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_333) |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-03 04:05:14,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:14,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:14,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:14,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-03 04:05:14,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:14,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-03 04:05:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:05:14,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221983512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [254439700] [2022-11-03 04:05:14,202 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:14,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:14,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 04:05:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270111849] [2022-11-03 04:05:14,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:14,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:05:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:05:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=255, Unknown=2, NotChecked=66, Total=380 [2022-11-03 04:05:14,206 INFO L87 Difference]: Start difference. First operand 6299 states and 26430 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:15,086 INFO L93 Difference]: Finished difference Result 6305 states and 26415 transitions. [2022-11-03 04:05:15,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:15,087 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:15,135 INFO L225 Difference]: With dead ends: 6305 [2022-11-03 04:05:15,135 INFO L226 Difference]: Without dead ends: 6305 [2022-11-03 04:05:15,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=417, Unknown=2, NotChecked=86, Total=600 [2022-11-03 04:05:15,137 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:15,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 65 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 137 Unchecked, 0.5s Time] [2022-11-03 04:05:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2022-11-03 04:05:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 6299. [2022-11-03 04:05:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5957 states have (on average 4.432768171898607) internal successors, (26406), 6298 states have internal predecessors, (26406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 26406 transitions. [2022-11-03 04:05:15,474 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 26406 transitions. Word has length 11 [2022-11-03 04:05:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:15,474 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 26406 transitions. [2022-11-03 04:05:15,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 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-03 04:05:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 26406 transitions. [2022-11-03 04:05:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:15,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:15,476 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:15,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:05:15,703 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2052873496, now seen corresponding path program 1 times [2022-11-03 04:05:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:15,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638759398] [2022-11-03 04:05:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:16,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638759398] [2022-11-03 04:05:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638759398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:16,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496913514] [2022-11-03 04:05:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:16,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:16,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:16,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:05:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:16,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 04:05:16,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:16,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:16,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:16,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:16,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:16,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:16,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:05:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:16,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:17,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_381 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:05:17,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) is different from false [2022-11-03 04:05:17,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_380) |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) is different from false [2022-11-03 04:05:17,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:17,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:17,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:17,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:05:17,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-11-03 04:05:17,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 94 [2022-11-03 04:05:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:05:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496913514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1514693836] [2022-11-03 04:05:17,351 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:17,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:17,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:05:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538768183] [2022-11-03 04:05:17,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:17,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=296, Unknown=3, NotChecked=108, Total=462 [2022-11-03 04:05:17,356 INFO L87 Difference]: Start difference. First operand 6299 states and 26406 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:17,483 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= c_~t_4~0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_380 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_380) |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:05:17,489 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_58| Int) (v_ArrVal_381 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_58| v_ArrVal_381) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_58|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:05:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:18,651 INFO L93 Difference]: Finished difference Result 10904 states and 44405 transitions. [2022-11-03 04:05:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:05:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:18,721 INFO L225 Difference]: With dead ends: 10904 [2022-11-03 04:05:18,721 INFO L226 Difference]: Without dead ends: 10904 [2022-11-03 04:05:18,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=397, Unknown=5, NotChecked=220, Total=702 [2022-11-03 04:05:18,723 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:18,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 189 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1164 Invalid, 0 Unknown, 357 Unchecked, 1.0s Time] [2022-11-03 04:05:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10904 states. [2022-11-03 04:05:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10904 to 6327. [2022-11-03 04:05:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 5985 states have (on average 4.433082706766918) internal successors, (26532), 6326 states have internal predecessors, (26532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 26532 transitions. [2022-11-03 04:05:19,064 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 26532 transitions. Word has length 11 [2022-11-03 04:05:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 6327 states and 26532 transitions. [2022-11-03 04:05:19,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 26532 transitions. [2022-11-03 04:05:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:05:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:19,066 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:19,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:19,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 04:05:19,274 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2052873493, now seen corresponding path program 1 times [2022-11-03 04:05:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:19,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523454517] [2022-11-03 04:05:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:19,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:19,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523454517] [2022-11-03 04:05:19,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523454517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:19,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430966505] [2022-11-03 04:05:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:19,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:19,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:19,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:19,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:05:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:20,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:05:20,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:20,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:20,127 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:05:20,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:05:20,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:20,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:20,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:20,282 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:05:20,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:05:20,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:20,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:05:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:20,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:20,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_432) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:05:20,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:20,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:05:20,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:20,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:05:20,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 [2022-11-03 04:05:20,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-11-03 04:05:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:20,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430966505] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [321625616] [2022-11-03 04:05:20,823 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:20,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:20,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:05:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116849312] [2022-11-03 04:05:20,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:20,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=362, Unknown=2, NotChecked=38, Total=462 [2022-11-03 04:05:20,827 INFO L87 Difference]: Start difference. First operand 6327 states and 26532 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:21,728 INFO L93 Difference]: Finished difference Result 11113 states and 45254 transitions. [2022-11-03 04:05:21,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:05:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:21,787 INFO L225 Difference]: With dead ends: 11113 [2022-11-03 04:05:21,787 INFO L226 Difference]: Without dead ends: 11113 [2022-11-03 04:05:21,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=584, Unknown=2, NotChecked=50, Total=756 [2022-11-03 04:05:21,788 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:21,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 155 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 556 Invalid, 0 Unknown, 408 Unchecked, 0.5s Time] [2022-11-03 04:05:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-03 04:05:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 6409. [2022-11-03 04:05:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6409 states, 6067 states have (on average 4.428383055876051) internal successors, (26867), 6408 states have internal predecessors, (26867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 26867 transitions. [2022-11-03 04:05:22,086 INFO L78 Accepts]: Start accepts. Automaton has 6409 states and 26867 transitions. Word has length 11 [2022-11-03 04:05:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:22,086 INFO L495 AbstractCegarLoop]: Abstraction has 6409 states and 26867 transitions. [2022-11-03 04:05:22,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 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-03 04:05:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6409 states and 26867 transitions. [2022-11-03 04:05:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:22,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:22,088 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:22,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:22,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 04:05:22,302 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -372731644, now seen corresponding path program 3 times [2022-11-03 04:05:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982453611] [2022-11-03 04:05:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:22,796 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-03 04:05:22,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982453611] [2022-11-03 04:05:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982453611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904873534] [2022-11-03 04:05:22,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:05:22,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:22,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:22,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:05:22,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:05:22,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:22,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 04:05:22,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:23,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:23,108 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:05:23,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:05:23,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:23,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:23,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:23,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:23,240 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-03 04:05:23,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:23,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 04:05:23,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) |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-03 04:05:23,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_473 Int) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (< 0 (+ (select (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~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_473)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_476) |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-03 04:05:23,370 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:05:23,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 04:05:23,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:23,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:05:23,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 59 [2022-11-03 04:05:23,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-11-03 04:05:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 04:05:23,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904873534] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:23,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [95952018] [2022-11-03 04:05:23,514 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:23,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:23,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 04:05:23,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628229479] [2022-11-03 04:05:23,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:23,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 04:05:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 04:05:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=324, Unknown=3, NotChecked=114, Total=506 [2022-11-03 04:05:23,518 INFO L87 Difference]: Start difference. First operand 6409 states and 26867 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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-03 04:05:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:24,459 INFO L93 Difference]: Finished difference Result 6415 states and 26870 transitions. [2022-11-03 04:05:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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-03 04:05:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:24,488 INFO L225 Difference]: With dead ends: 6415 [2022-11-03 04:05:24,488 INFO L226 Difference]: Without dead ends: 6415 [2022-11-03 04:05:24,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=500, Unknown=3, NotChecked=144, Total=756 [2022-11-03 04:05:24,489 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:24,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 90 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 709 Invalid, 0 Unknown, 201 Unchecked, 0.6s Time] [2022-11-03 04:05:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6415 states. [2022-11-03 04:05:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6415 to 6384. [2022-11-03 04:05:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6384 states, 6042 states have (on average 4.43545183714002) internal successors, (26799), 6383 states have internal predecessors, (26799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6384 states to 6384 states and 26799 transitions. [2022-11-03 04:05:24,705 INFO L78 Accepts]: Start accepts. Automaton has 6384 states and 26799 transitions. Word has length 12 [2022-11-03 04:05:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:24,706 INFO L495 AbstractCegarLoop]: Abstraction has 6384 states and 26799 transitions. [2022-11-03 04:05:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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-03 04:05:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6384 states and 26799 transitions. [2022-11-03 04:05:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:24,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:24,707 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:24,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:24,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:05:24,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 815912944, now seen corresponding path program 2 times [2022-11-03 04:05:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:24,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750718348] [2022-11-03 04:05:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:24,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:25,480 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-03 04:05:25,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:25,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750718348] [2022-11-03 04:05:25,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750718348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:25,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325881869] [2022-11-03 04:05:25,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:25,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:25,487 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:25,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:05:25,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:05:25,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:25,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:05:25,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:25,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:25,795 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:05:25,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:05:25,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:25,955 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:05:25,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 04:05:26,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:26,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:26,051 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:05:26,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:05:26,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:26,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:05:26,151 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-03 04:05:26,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:26,325 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_533) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:05:26,540 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:05:26,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 04:05:26,554 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:26,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:05:26,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:26,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 47 [2022-11-03 04:05:26,786 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-03 04:05:26,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325881869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019081828] [2022-11-03 04:05:26,787 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:26,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:26,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:05:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069087681] [2022-11-03 04:05:26,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:26,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:05:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:05:26,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=4, NotChecked=44, Total=600 [2022-11-03 04:05:26,790 INFO L87 Difference]: Start difference. First operand 6384 states and 26799 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:28,142 INFO L93 Difference]: Finished difference Result 12271 states and 52239 transitions. [2022-11-03 04:05:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:05:28,143 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:05:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:28,205 INFO L225 Difference]: With dead ends: 12271 [2022-11-03 04:05:28,205 INFO L226 Difference]: Without dead ends: 12271 [2022-11-03 04:05:28,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=4, NotChecked=56, Total=930 [2022-11-03 04:05:28,206 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 116 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:28,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 224 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 933 Invalid, 0 Unknown, 567 Unchecked, 0.8s Time] [2022-11-03 04:05:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12271 states. [2022-11-03 04:05:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12271 to 6852. [2022-11-03 04:05:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6852 states, 6510 states have (on average 4.521966205837174) internal successors, (29438), 6851 states have internal predecessors, (29438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 29438 transitions. [2022-11-03 04:05:28,507 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 29438 transitions. Word has length 12 [2022-11-03 04:05:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:28,507 INFO L495 AbstractCegarLoop]: Abstraction has 6852 states and 29438 transitions. [2022-11-03 04:05:28,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 29438 transitions. [2022-11-03 04:05:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:28,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:28,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:28,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:28,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:05:28,718 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1021293729, now seen corresponding path program 1 times [2022-11-03 04:05:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239141331] [2022-11-03 04:05:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:28,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239141331] [2022-11-03 04:05:28,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239141331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731328845] [2022-11-03 04:05:28,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:28,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:28,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:28,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:28,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:05:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:29,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:05:29,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:29,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:29,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731328845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:29,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432372462] [2022-11-03 04:05:29,271 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:29,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:29,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-03 04:05:29,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692621267] [2022-11-03 04:05:29,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:29,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 04:05:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:29,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 04:05:29,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:05:29,275 INFO L87 Difference]: Start difference. First operand 6852 states and 29438 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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-03 04:05:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:30,251 INFO L93 Difference]: Finished difference Result 11153 states and 45407 transitions. [2022-11-03 04:05:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:05:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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 12 [2022-11-03 04:05:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:30,316 INFO L225 Difference]: With dead ends: 11153 [2022-11-03 04:05:30,316 INFO L226 Difference]: Without dead ends: 11113 [2022-11-03 04:05:30,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:05:30,317 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 348 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 188 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 04:05:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2022-11-03 04:05:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10021. [2022-11-03 04:05:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10021 states, 9679 states have (on average 4.441987808657919) internal successors, (42994), 10020 states have internal predecessors, (42994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10021 states to 10021 states and 42994 transitions. [2022-11-03 04:05:30,677 INFO L78 Accepts]: Start accepts. Automaton has 10021 states and 42994 transitions. Word has length 12 [2022-11-03 04:05:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:30,677 INFO L495 AbstractCegarLoop]: Abstraction has 10021 states and 42994 transitions. [2022-11-03 04:05:30,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 16 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-03 04:05:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10021 states and 42994 transitions. [2022-11-03 04:05:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:30,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:30,679 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:30,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:30,879 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2015994715, now seen corresponding path program 1 times [2022-11-03 04:05:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:30,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239922171] [2022-11-03 04:05:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:31,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239922171] [2022-11-03 04:05:31,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239922171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:31,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613039391] [2022-11-03 04:05:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:31,365 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:31,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:05:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:31,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 04:05:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:31,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:31,592 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:05:31,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:05:31,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:31,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:31,742 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:05:31,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:05:31,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:31,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:05:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:31,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:31,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_618) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:05:32,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:32,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:32,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:32,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-03 04:05:32,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:32,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613039391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131866122] [2022-11-03 04:05:32,328 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:32,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:32,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:05:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502759629] [2022-11-03 04:05:32,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=362, Unknown=2, NotChecked=38, Total=462 [2022-11-03 04:05:32,331 INFO L87 Difference]: Start difference. First operand 10021 states and 42994 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:33,491 INFO L93 Difference]: Finished difference Result 19245 states and 83050 transitions. [2022-11-03 04:05:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:05:33,491 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:05:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:33,592 INFO L225 Difference]: With dead ends: 19245 [2022-11-03 04:05:33,592 INFO L226 Difference]: Without dead ends: 19245 [2022-11-03 04:05:33,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=576, Unknown=2, NotChecked=50, Total=756 [2022-11-03 04:05:33,593 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 144 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:33,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 204 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 964 Invalid, 0 Unknown, 424 Unchecked, 0.7s Time] [2022-11-03 04:05:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19245 states. [2022-11-03 04:05:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19245 to 10129. [2022-11-03 04:05:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10129 states, 9787 states have (on average 4.442219270460815) internal successors, (43476), 10128 states have internal predecessors, (43476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10129 states to 10129 states and 43476 transitions. [2022-11-03 04:05:34,101 INFO L78 Accepts]: Start accepts. Automaton has 10129 states and 43476 transitions. Word has length 12 [2022-11-03 04:05:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:34,101 INFO L495 AbstractCegarLoop]: Abstraction has 10129 states and 43476 transitions. [2022-11-03 04:05:34,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 10129 states and 43476 transitions. [2022-11-03 04:05:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:34,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:34,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:34,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:34,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:34,330 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2015994712, now seen corresponding path program 1 times [2022-11-03 04:05:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:34,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150726261] [2022-11-03 04:05:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:34,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:34,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150726261] [2022-11-03 04:05:34,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150726261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:34,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157773247] [2022-11-03 04:05:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:34,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:34,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:34,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:34,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:05:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:35,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 04:05:35,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:35,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:35,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:35,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:35,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:35,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:35,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:05:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:35,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:35,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:05:35,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-03 04:05:35,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int) (v_ArrVal_665 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) |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-03 04:05:35,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:35,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:05:35,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:35,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-03 04:05:35,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:35,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:05:35,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157773247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:35,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072307507] [2022-11-03 04:05:35,643 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:35,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:35,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:05:35,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296351394] [2022-11-03 04:05:35,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:35,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=296, Unknown=3, NotChecked=108, Total=462 [2022-11-03 04:05:35,647 INFO L87 Difference]: Start difference. First operand 10129 states and 43476 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:35,755 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int) (v_ArrVal_665 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_665) |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 9223372039002259456)))) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:05:35,760 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_666 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_68|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_68| v_ArrVal_666) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:05:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:36,678 INFO L93 Difference]: Finished difference Result 18163 states and 75490 transitions. [2022-11-03 04:05:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:05:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:05:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:36,759 INFO L225 Difference]: With dead ends: 18163 [2022-11-03 04:05:36,759 INFO L226 Difference]: Without dead ends: 18155 [2022-11-03 04:05:36,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=397, Unknown=5, NotChecked=220, Total=702 [2022-11-03 04:05:36,760 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:36,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 181 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1047 Invalid, 0 Unknown, 273 Unchecked, 0.8s Time] [2022-11-03 04:05:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18155 states. [2022-11-03 04:05:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18155 to 10725. [2022-11-03 04:05:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10725 states, 10383 states have (on average 4.444187614369643) internal successors, (46144), 10724 states have internal predecessors, (46144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10725 states to 10725 states and 46144 transitions. [2022-11-03 04:05:37,092 INFO L78 Accepts]: Start accepts. Automaton has 10725 states and 46144 transitions. Word has length 12 [2022-11-03 04:05:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:37,092 INFO L495 AbstractCegarLoop]: Abstraction has 10725 states and 46144 transitions. [2022-11-03 04:05:37,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10725 states and 46144 transitions. [2022-11-03 04:05:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:37,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:37,094 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:37,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:37,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 04:05:37,296 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -785427169, now seen corresponding path program 2 times [2022-11-03 04:05:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:37,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338920309] [2022-11-03 04:05:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:37,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338920309] [2022-11-03 04:05:37,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338920309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796936882] [2022-11-03 04:05:37,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:37,717 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:37,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:05:37,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:05:37,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:37,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 04:05:37,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:37,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:37,975 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:05:37,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:05:38,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:38,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:38,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:38,108 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:05:38,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:05:38,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:38,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:05:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:38,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:38,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_717) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:05:38,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:38,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:38,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:38,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-03 04:05:38,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:38,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-03 04:05:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796936882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50709609] [2022-11-03 04:05:38,585 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:38,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:38,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:05:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545493548] [2022-11-03 04:05:38,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:38,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:38,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=367, Unknown=2, NotChecked=38, Total=462 [2022-11-03 04:05:38,588 INFO L87 Difference]: Start difference. First operand 10725 states and 46144 transitions. Second operand has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:39,667 INFO L93 Difference]: Finished difference Result 15081 states and 65331 transitions. [2022-11-03 04:05:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:05:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:05:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:39,755 INFO L225 Difference]: With dead ends: 15081 [2022-11-03 04:05:39,755 INFO L226 Difference]: Without dead ends: 15073 [2022-11-03 04:05:39,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=725, Unknown=2, NotChecked=56, Total=930 [2022-11-03 04:05:39,756 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 267 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:39,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 100 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 656 Invalid, 0 Unknown, 411 Unchecked, 0.6s Time] [2022-11-03 04:05:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15073 states. [2022-11-03 04:05:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15073 to 10361. [2022-11-03 04:05:40,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10361 states, 10019 states have (on average 4.431080946202216) internal successors, (44395), 10360 states have internal predecessors, (44395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10361 states to 10361 states and 44395 transitions. [2022-11-03 04:05:40,054 INFO L78 Accepts]: Start accepts. Automaton has 10361 states and 44395 transitions. Word has length 12 [2022-11-03 04:05:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 10361 states and 44395 transitions. [2022-11-03 04:05:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10361 states and 44395 transitions. [2022-11-03 04:05:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:05:40,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:40,056 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:40,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:40,266 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -785429683, now seen corresponding path program 1 times [2022-11-03 04:05:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:40,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685343903] [2022-11-03 04:05:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:40,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685343903] [2022-11-03 04:05:40,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685343903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:40,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934059165] [2022-11-03 04:05:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:40,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:40,433 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:40,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:05:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:40,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:05:40,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:40,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:40,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934059165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:40,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905340541] [2022-11-03 04:05:40,839 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:40,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-03 04:05:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84323086] [2022-11-03 04:05:40,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:40,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 04:05:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 04:05:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:05:40,841 INFO L87 Difference]: Start difference. First operand 10361 states and 44395 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 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-03 04:05:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:41,354 INFO L93 Difference]: Finished difference Result 8551 states and 34978 transitions. [2022-11-03 04:05:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:05:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 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 12 [2022-11-03 04:05:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:41,386 INFO L225 Difference]: With dead ends: 8551 [2022-11-03 04:05:41,387 INFO L226 Difference]: Without dead ends: 8503 [2022-11-03 04:05:41,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:05:41,387 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 121 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:05:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2022-11-03 04:05:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8049. [2022-11-03 04:05:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8049 states, 7707 states have (on average 4.373816011418191) internal successors, (33709), 8048 states have internal predecessors, (33709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8049 states to 8049 states and 33709 transitions. [2022-11-03 04:05:41,601 INFO L78 Accepts]: Start accepts. Automaton has 8049 states and 33709 transitions. Word has length 12 [2022-11-03 04:05:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:41,601 INFO L495 AbstractCegarLoop]: Abstraction has 8049 states and 33709 transitions. [2022-11-03 04:05:41,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 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-03 04:05:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8049 states and 33709 transitions. [2022-11-03 04:05:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:41,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:41,602 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:41,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:41,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:41,810 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread4Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222281, now seen corresponding path program 2 times [2022-11-03 04:05:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:41,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779601001] [2022-11-03 04:05:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:41,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779601001] [2022-11-03 04:05:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779601001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:41,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:41,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055965295] [2022-11-03 04:05:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:41,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:41,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:41,864 INFO L87 Difference]: Start difference. First operand 8049 states and 33709 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:41,996 INFO L93 Difference]: Finished difference Result 7475 states and 31423 transitions. [2022-11-03 04:05:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:41,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:42,029 INFO L225 Difference]: With dead ends: 7475 [2022-11-03 04:05:42,029 INFO L226 Difference]: Without dead ends: 7475 [2022-11-03 04:05:42,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:42,030 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:42,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 9 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7475 states. [2022-11-03 04:05:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7475 to 7475. [2022-11-03 04:05:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7182 states have (on average 4.375243664717349) internal successors, (31423), 7474 states have internal predecessors, (31423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 31423 transitions. [2022-11-03 04:05:42,193 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 31423 transitions. Word has length 13 [2022-11-03 04:05:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 7475 states and 31423 transitions. [2022-11-03 04:05:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 31423 transitions. [2022-11-03 04:05:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:42,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:42,195 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:42,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 04:05:42,195 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222282, now seen corresponding path program 1 times [2022-11-03 04:05:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:42,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459176757] [2022-11-03 04:05:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:42,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:42,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459176757] [2022-11-03 04:05:42,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459176757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:42,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:42,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27735270] [2022-11-03 04:05:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:42,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:42,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:42,266 INFO L87 Difference]: Start difference. First operand 7475 states and 31423 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:42,377 INFO L93 Difference]: Finished difference Result 6901 states and 29137 transitions. [2022-11-03 04:05:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:42,402 INFO L225 Difference]: With dead ends: 6901 [2022-11-03 04:05:42,402 INFO L226 Difference]: Without dead ends: 6901 [2022-11-03 04:05:42,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:42,403 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:42,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2022-11-03 04:05:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6333. [2022-11-03 04:05:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6333 states, 6089 states have (on average 3.9523731318771556) internal successors, (24066), 6332 states have internal predecessors, (24066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 24066 transitions. [2022-11-03 04:05:42,545 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 24066 transitions. Word has length 13 [2022-11-03 04:05:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:42,546 INFO L495 AbstractCegarLoop]: Abstraction has 6333 states and 24066 transitions. [2022-11-03 04:05:42,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 24066 transitions. [2022-11-03 04:05:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:42,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:42,547 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:42,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 04:05:42,547 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222283, now seen corresponding path program 1 times [2022-11-03 04:05:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497106430] [2022-11-03 04:05:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:42,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:42,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497106430] [2022-11-03 04:05:42,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497106430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:42,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304600098] [2022-11-03 04:05:42,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:42,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:42,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:42,970 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:42,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 04:05:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:43,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:05:43,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:43,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:43,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:43,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:43,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:43,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:43,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_841) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:05:43,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_841) |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-03 04:05:43,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:43,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:05:43,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:43,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:05:43,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 [2022-11-03 04:05:43,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 55 [2022-11-03 04:05:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:05:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304600098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:43,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278344219] [2022-11-03 04:05:43,692 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:43,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:43,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:05:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239671315] [2022-11-03 04:05:43,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:43,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:05:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:05:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=483, Unknown=2, NotChecked=90, Total=650 [2022-11-03 04:05:43,695 INFO L87 Difference]: Start difference. First operand 6333 states and 24066 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:44,761 INFO L93 Difference]: Finished difference Result 6569 states and 24572 transitions. [2022-11-03 04:05:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:05:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:44,782 INFO L225 Difference]: With dead ends: 6569 [2022-11-03 04:05:44,782 INFO L226 Difference]: Without dead ends: 6569 [2022-11-03 04:05:44,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=804, Unknown=2, NotChecked=118, Total=1056 [2022-11-03 04:05:44,783 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:44,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 138 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 979 Invalid, 0 Unknown, 168 Unchecked, 0.7s Time] [2022-11-03 04:05:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2022-11-03 04:05:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6339. [2022-11-03 04:05:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6095 states have (on average 3.9529122231337164) internal successors, (24093), 6338 states have internal predecessors, (24093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 24093 transitions. [2022-11-03 04:05:44,910 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 24093 transitions. Word has length 13 [2022-11-03 04:05:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:44,911 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 24093 transitions. [2022-11-03 04:05:44,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:44,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 24093 transitions. [2022-11-03 04:05:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:44,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:44,912 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:44,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:45,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 04:05:45,113 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:45,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1330222287, now seen corresponding path program 1 times [2022-11-03 04:05:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941399831] [2022-11-03 04:05:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:45,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941399831] [2022-11-03 04:05:45,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941399831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:45,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658879655] [2022-11-03 04:05:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:45,585 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:45,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 04:05:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:45,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:05:45,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:45,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:45,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:45,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:46,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:46,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:46,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:46,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_883) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-03 04:05:46,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_883) |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-03 04:05:46,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:46,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:46,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:46,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:05:46,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-03 04:05:46,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 94 [2022-11-03 04:05:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:05:46,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658879655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:46,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669793526] [2022-11-03 04:05:46,367 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:46,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:46,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:05:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838751286] [2022-11-03 04:05:46,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:05:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:46,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:05:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=483, Unknown=2, NotChecked=90, Total=650 [2022-11-03 04:05:46,371 INFO L87 Difference]: Start difference. First operand 6339 states and 24093 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:47,361 INFO L93 Difference]: Finished difference Result 6569 states and 24566 transitions. [2022-11-03 04:05:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:05:47,362 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:47,383 INFO L225 Difference]: With dead ends: 6569 [2022-11-03 04:05:47,384 INFO L226 Difference]: Without dead ends: 6569 [2022-11-03 04:05:47,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=804, Unknown=2, NotChecked=118, Total=1056 [2022-11-03 04:05:47,384 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 181 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:47,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 125 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 815 Invalid, 0 Unknown, 208 Unchecked, 0.6s Time] [2022-11-03 04:05:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6569 states. [2022-11-03 04:05:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6569 to 6339. [2022-11-03 04:05:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6095 states have (on average 3.9519278096800656) internal successors, (24087), 6338 states have internal predecessors, (24087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 24087 transitions. [2022-11-03 04:05:47,514 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 24087 transitions. Word has length 13 [2022-11-03 04:05:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:47,514 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 24087 transitions. [2022-11-03 04:05:47,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-03 04:05:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 24087 transitions. [2022-11-03 04:05:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:47,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:47,516 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:47,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:47,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 04:05:47,730 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:47,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1970044032, now seen corresponding path program 2 times [2022-11-03 04:05:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:47,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327145877] [2022-11-03 04:05:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:48,154 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-03 04:05:48,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:48,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327145877] [2022-11-03 04:05:48,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327145877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454918447] [2022-11-03 04:05:48,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:48,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:48,158 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:48,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 04:05:48,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:05:48,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 04:05:48,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:48,489 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:05:48,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:05:48,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:48,586 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:05:48,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:05:48,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:48,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:48,666 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:05:48,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:05:48,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:05:48,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:05:48,742 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-03 04:05:48,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:48,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_940) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:05:48,983 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:05:48,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 04:05:48,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:48,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:05:49,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 [2022-11-03 04:05:49,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-11-03 04:05:49,175 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-03 04:05:49,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454918447] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:49,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1998442313] [2022-11-03 04:05:49,176 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:49,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:49,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:05:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638666987] [2022-11-03 04:05:49,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:49,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:05:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:05:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=4, NotChecked=44, Total=600 [2022-11-03 04:05:49,178 INFO L87 Difference]: Start difference. First operand 6339 states and 24087 transitions. Second operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:50,178 INFO L93 Difference]: Finished difference Result 8659 states and 32275 transitions. [2022-11-03 04:05:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 04:05:50,178 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:50,209 INFO L225 Difference]: With dead ends: 8659 [2022-11-03 04:05:50,209 INFO L226 Difference]: Without dead ends: 8627 [2022-11-03 04:05:50,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=981, Unknown=4, NotChecked=66, Total=1260 [2022-11-03 04:05:50,211 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 221 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:50,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 77 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 461 Invalid, 0 Unknown, 668 Unchecked, 0.4s Time] [2022-11-03 04:05:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2022-11-03 04:05:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 6141. [2022-11-03 04:05:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 5897 states have (on average 3.8899440393420384) internal successors, (22939), 6140 states have internal predecessors, (22939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 22939 transitions. [2022-11-03 04:05:50,349 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 22939 transitions. Word has length 13 [2022-11-03 04:05:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:50,350 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 22939 transitions. [2022-11-03 04:05:50,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 22939 transitions. [2022-11-03 04:05:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:50,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:50,351 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:50,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:50,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 04:05:50,555 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:50,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:50,555 INFO L85 PathProgramCache]: Analyzing trace with hash -476501132, now seen corresponding path program 1 times [2022-11-03 04:05:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538571368] [2022-11-03 04:05:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:50,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:50,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538571368] [2022-11-03 04:05:50,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538571368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:50,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236970726] [2022-11-03 04:05:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:50,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:50,615 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:50,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 04:05:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:50,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:05:50,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:50,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:50,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236970726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:50,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1794477035] [2022-11-03 04:05:50,876 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:50,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:50,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 04:05:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48719262] [2022-11-03 04:05:50,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:05:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:05:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:05:50,879 INFO L87 Difference]: Start difference. First operand 6141 states and 22939 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-03 04:05:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:51,332 INFO L93 Difference]: Finished difference Result 14947 states and 54472 transitions. [2022-11-03 04:05:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:05:51,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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 13 [2022-11-03 04:05:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:51,393 INFO L225 Difference]: With dead ends: 14947 [2022-11-03 04:05:51,394 INFO L226 Difference]: Without dead ends: 14947 [2022-11-03 04:05:51,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:05:51,395 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 298 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:51,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 45 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:05:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14947 states. [2022-11-03 04:05:51,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14947 to 9345. [2022-11-03 04:05:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9345 states, 9101 states have (on average 4.476760795516976) internal successors, (40743), 9344 states have internal predecessors, (40743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9345 states to 9345 states and 40743 transitions. [2022-11-03 04:05:51,638 INFO L78 Accepts]: Start accepts. Automaton has 9345 states and 40743 transitions. Word has length 13 [2022-11-03 04:05:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:51,639 INFO L495 AbstractCegarLoop]: Abstraction has 9345 states and 40743 transitions. [2022-11-03 04:05:51,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-03 04:05:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 9345 states and 40743 transitions. [2022-11-03 04:05:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:51,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:51,640 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:51,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 04:05:51,840 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash -476501131, now seen corresponding path program 2 times [2022-11-03 04:05:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642613955] [2022-11-03 04:05:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:51,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642613955] [2022-11-03 04:05:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642613955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633511127] [2022-11-03 04:05:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:51,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:51,945 INFO L87 Difference]: Start difference. First operand 9345 states and 40743 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:52,085 INFO L93 Difference]: Finished difference Result 8175 states and 34744 transitions. [2022-11-03 04:05:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:52,129 INFO L225 Difference]: With dead ends: 8175 [2022-11-03 04:05:52,130 INFO L226 Difference]: Without dead ends: 8175 [2022-11-03 04:05:52,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:52,131 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:52,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 9 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2022-11-03 04:05:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8175. [2022-11-03 04:05:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8175 states, 7996 states have (on average 4.345172586293146) internal successors, (34744), 8174 states have internal predecessors, (34744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8175 states to 8175 states and 34744 transitions. [2022-11-03 04:05:52,509 INFO L78 Accepts]: Start accepts. Automaton has 8175 states and 34744 transitions. Word has length 13 [2022-11-03 04:05:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:52,510 INFO L495 AbstractCegarLoop]: Abstraction has 8175 states and 34744 transitions. [2022-11-03 04:05:52,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8175 states and 34744 transitions. [2022-11-03 04:05:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:52,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:52,511 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:52,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 04:05:52,512 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash -476501129, now seen corresponding path program 1 times [2022-11-03 04:05:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156356682] [2022-11-03 04:05:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:52,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:52,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156356682] [2022-11-03 04:05:52,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156356682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:52,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:52,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248903091] [2022-11-03 04:05:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:52,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:52,608 INFO L87 Difference]: Start difference. First operand 8175 states and 34744 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:52,724 INFO L93 Difference]: Finished difference Result 7077 states and 29313 transitions. [2022-11-03 04:05:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:52,750 INFO L225 Difference]: With dead ends: 7077 [2022-11-03 04:05:52,751 INFO L226 Difference]: Without dead ends: 7077 [2022-11-03 04:05:52,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:52,754 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:52,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 9 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2022-11-03 04:05:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 7077. [2022-11-03 04:05:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 6953 states have (on average 4.215878038256868) internal successors, (29313), 7076 states have internal predecessors, (29313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 29313 transitions. [2022-11-03 04:05:52,987 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 29313 transitions. Word has length 13 [2022-11-03 04:05:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:52,988 INFO L495 AbstractCegarLoop]: Abstraction has 7077 states and 29313 transitions. [2022-11-03 04:05:52,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 29313 transitions. [2022-11-03 04:05:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:05:52,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:52,989 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:52,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 04:05:52,989 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -476501127, now seen corresponding path program 1 times [2022-11-03 04:05:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:52,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651011635] [2022-11-03 04:05:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:53,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:53,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651011635] [2022-11-03 04:05:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651011635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:05:53,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:05:53,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:05:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436004926] [2022-11-03 04:05:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:05:53,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:05:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:05:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:53,041 INFO L87 Difference]: Start difference. First operand 7077 states and 29313 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:53,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:53,148 INFO L93 Difference]: Finished difference Result 5871 states and 23030 transitions. [2022-11-03 04:05:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:05:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:05:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:53,175 INFO L225 Difference]: With dead ends: 5871 [2022-11-03 04:05:53,175 INFO L226 Difference]: Without dead ends: 5871 [2022-11-03 04:05:53,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:05:53,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:53,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:05:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2022-11-03 04:05:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5871. [2022-11-03 04:05:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5792 states have (on average 3.9761740331491713) internal successors, (23030), 5870 states have internal predecessors, (23030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 23030 transitions. [2022-11-03 04:05:53,297 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 23030 transitions. Word has length 13 [2022-11-03 04:05:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:53,297 INFO L495 AbstractCegarLoop]: Abstraction has 5871 states and 23030 transitions. [2022-11-03 04:05:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 23030 transitions. [2022-11-03 04:05:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:05:53,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:53,298 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:53,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 04:05:53,298 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:53,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:53,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1712780828, now seen corresponding path program 2 times [2022-11-03 04:05:53,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:53,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991870969] [2022-11-03 04:05:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:53,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991870969] [2022-11-03 04:05:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991870969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:53,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123665491] [2022-11-03 04:05:53,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:53,559 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:53,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 04:05:53,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:05:53,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:53,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 04:05:53,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:54,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:54,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123665491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:54,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512800334] [2022-11-03 04:05:54,172 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:54,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:54,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 04:05:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601350388] [2022-11-03 04:05:54,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:54,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:05:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:54,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:05:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-11-03 04:05:54,174 INFO L87 Difference]: Start difference. First operand 5871 states and 23030 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-03 04:05:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:55,527 INFO L93 Difference]: Finished difference Result 12276 states and 48193 transitions. [2022-11-03 04:05:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:05:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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 14 [2022-11-03 04:05:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:55,590 INFO L225 Difference]: With dead ends: 12276 [2022-11-03 04:05:55,590 INFO L226 Difference]: Without dead ends: 12232 [2022-11-03 04:05:55,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 04:05:55,594 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 814 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:55,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 321 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 04:05:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12232 states. [2022-11-03 04:05:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12232 to 7314. [2022-11-03 04:05:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7314 states, 7235 states have (on average 4.0217000691085) internal successors, (29097), 7313 states have internal predecessors, (29097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7314 states to 7314 states and 29097 transitions. [2022-11-03 04:05:55,863 INFO L78 Accepts]: Start accepts. Automaton has 7314 states and 29097 transitions. Word has length 14 [2022-11-03 04:05:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:55,863 INFO L495 AbstractCegarLoop]: Abstraction has 7314 states and 29097 transitions. [2022-11-03 04:05:55,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-03 04:05:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7314 states and 29097 transitions. [2022-11-03 04:05:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:05:55,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:55,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:55,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:56,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:56,067 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1886632068, now seen corresponding path program 1 times [2022-11-03 04:05:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358946333] [2022-11-03 04:05:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:56,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:56,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358946333] [2022-11-03 04:05:56,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358946333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:56,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511121055] [2022-11-03 04:05:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:56,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:56,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:56,626 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:56,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 04:05:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:56,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:05:56,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:56,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:05:57,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:57,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:57,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:57,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:05:57,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:05:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:57,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:57,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:05:57,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)))) is different from false [2022-11-03 04:05:57,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1149 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1149) |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) |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-03 04:05:57,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:05:57,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-03 04:05:57,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:05:57,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-03 04:05:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:05:57,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511121055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [138743828] [2022-11-03 04:05:57,549 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:05:57,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 04:05:57,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072060001] [2022-11-03 04:05:57,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:57,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:05:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:57,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:05:57,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=538, Unknown=3, NotChecked=144, Total=756 [2022-11-03 04:05:57,552 INFO L87 Difference]: Start difference. First operand 7314 states and 29097 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:05:57,729 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= (select .cse0 8) 2147483647) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse0 .cse1) 2147483647) (<= c_~t_4~0 2147483647) (forall ((v_ArrVal_1149 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1149) |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 4294967296))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:05:57,742 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_80| Int) (v_ArrVal_1150 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_80| v_ArrVal_1150) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_80|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:05:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:58,757 INFO L93 Difference]: Finished difference Result 10951 states and 42870 transitions. [2022-11-03 04:05:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:05:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:05:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:58,796 INFO L225 Difference]: With dead ends: 10951 [2022-11-03 04:05:58,796 INFO L226 Difference]: Without dead ends: 10951 [2022-11-03 04:05:58,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=942, Unknown=5, NotChecked=330, Total=1406 [2022-11-03 04:05:58,797 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 340 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:58,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 214 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1094 Invalid, 0 Unknown, 471 Unchecked, 0.8s Time] [2022-11-03 04:05:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10951 states. [2022-11-03 04:05:59,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10951 to 7593. [2022-11-03 04:05:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7514 states have (on average 4.053633217993079) internal successors, (30459), 7592 states have internal predecessors, (30459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 30459 transitions. [2022-11-03 04:05:59,077 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 30459 transitions. Word has length 14 [2022-11-03 04:05:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:59,077 INFO L495 AbstractCegarLoop]: Abstraction has 7593 states and 30459 transitions. [2022-11-03 04:05:59,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:05:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 30459 transitions. [2022-11-03 04:05:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:05:59,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:59,078 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:59,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:59,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-03 04:05:59,279 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:05:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1886632071, now seen corresponding path program 1 times [2022-11-03 04:05:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72447680] [2022-11-03 04:05:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:59,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72447680] [2022-11-03 04:05:59,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72447680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:59,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748247444] [2022-11-03 04:05:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:59,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:59,771 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:59,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 04:06:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:00,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:06:00,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:00,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:00,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:00,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:00,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:00,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:00,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:06:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:00,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:00,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1202) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:06:00,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) is different from false [2022-11-03 04:06:00,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1201) |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) is different from false [2022-11-03 04:06:00,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:00,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:06:00,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:00,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:06:00,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 59 [2022-11-03 04:06:00,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-11-03 04:06:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:06:00,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748247444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:00,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075373621] [2022-11-03 04:06:00,633 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:00,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:00,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 04:06:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268062856] [2022-11-03 04:06:00,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:00,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:06:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:06:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=542, Unknown=3, NotChecked=144, Total=756 [2022-11-03 04:06:00,635 INFO L87 Difference]: Start difference. First operand 7593 states and 30459 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:06:00,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1202 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1201) |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:06:00,851 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 .cse1) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((v_ArrVal_1202 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_82| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_82| v_ArrVal_1202) c_~X_0~0.base) .cse1) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_82|)))) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:06:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:02,040 INFO L93 Difference]: Finished difference Result 10951 states and 42618 transitions. [2022-11-03 04:06:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 04:06:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:06:02,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:02,077 INFO L225 Difference]: With dead ends: 10951 [2022-11-03 04:06:02,077 INFO L226 Difference]: Without dead ends: 10943 [2022-11-03 04:06:02,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=1065, Unknown=5, NotChecked=350, Total=1560 [2022-11-03 04:06:02,078 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 380 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 525 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:02,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 277 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1317 Invalid, 0 Unknown, 525 Unchecked, 0.9s Time] [2022-11-03 04:06:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10943 states. [2022-11-03 04:06:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10943 to 7338. [2022-11-03 04:06:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7338 states, 7259 states have (on average 4.018735362997658) internal successors, (29172), 7337 states have internal predecessors, (29172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7338 states to 7338 states and 29172 transitions. [2022-11-03 04:06:02,359 INFO L78 Accepts]: Start accepts. Automaton has 7338 states and 29172 transitions. Word has length 14 [2022-11-03 04:06:02,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:02,359 INFO L495 AbstractCegarLoop]: Abstraction has 7338 states and 29172 transitions. [2022-11-03 04:06:02,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 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-03 04:06:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7338 states and 29172 transitions. [2022-11-03 04:06:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:02,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:02,361 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:02,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:02,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-03 04:06:02,561 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2134825483, now seen corresponding path program 1 times [2022-11-03 04:06:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427370077] [2022-11-03 04:06:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:03,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427370077] [2022-11-03 04:06:03,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427370077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523067304] [2022-11-03 04:06:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:03,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:03,061 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:03,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 04:06:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:03,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 04:06:03,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:03,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:03,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:03,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:03,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:03,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:03,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:03,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:03,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:06:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:03,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:03,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:06:03,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:06:03,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296))) is different from false [2022-11-03 04:06:03,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1253) |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) |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-03 04:06:03,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:03,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:06:03,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:03,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:06:03,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 238 [2022-11-03 04:06:03,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 206 [2022-11-03 04:06:03,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 04:06:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:04,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523067304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:04,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192266987] [2022-11-03 04:06:04,198 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:04,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:04,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:06:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753980704] [2022-11-03 04:06:04,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:04,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:06:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:04,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:06:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:06:04,202 INFO L87 Difference]: Start difference. First operand 7338 states and 29172 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:04,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1253) |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= c_~t_4~0 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:06:04,344 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_84| Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1254 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_84|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_84| v_ArrVal_1254) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1255) c_~X_0~0.base) .cse0) 4294967296))) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select .cse1 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:06:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:05,233 INFO L93 Difference]: Finished difference Result 11242 states and 43318 transitions. [2022-11-03 04:06:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:06:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:05,271 INFO L225 Difference]: With dead ends: 11242 [2022-11-03 04:06:05,271 INFO L226 Difference]: Without dead ends: 11242 [2022-11-03 04:06:05,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=476, Unknown=6, NotChecked=294, Total=870 [2022-11-03 04:06:05,272 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 118 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 403 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:05,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 160 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1101 Invalid, 0 Unknown, 403 Unchecked, 0.8s Time] [2022-11-03 04:06:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11242 states. [2022-11-03 04:06:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11242 to 7500. [2022-11-03 04:06:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7500 states, 7421 states have (on average 4.017787360194044) internal successors, (29816), 7499 states have internal predecessors, (29816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7500 states to 7500 states and 29816 transitions. [2022-11-03 04:06:05,548 INFO L78 Accepts]: Start accepts. Automaton has 7500 states and 29816 transitions. Word has length 14 [2022-11-03 04:06:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:05,548 INFO L495 AbstractCegarLoop]: Abstraction has 7500 states and 29816 transitions. [2022-11-03 04:06:05,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7500 states and 29816 transitions. [2022-11-03 04:06:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:05,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:05,549 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:05,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:05,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:05,750 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2134825480, now seen corresponding path program 1 times [2022-11-03 04:06:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:05,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53189037] [2022-11-03 04:06:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:06,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53189037] [2022-11-03 04:06:06,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53189037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:06,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096604152] [2022-11-03 04:06:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:06,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:06,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:06,144 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:06,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 04:06:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:06,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 04:06:06,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:06,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:06,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:06,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:06,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:06:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:06,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:06,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:06:06,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:06:06,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-03 04:06:06,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1306) |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)))) is different from false [2022-11-03 04:06:06,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:06,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:06:06,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:06,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:06:06,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 270 [2022-11-03 04:06:06,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 238 [2022-11-03 04:06:06,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:06:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:07,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096604152] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:07,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1750616461] [2022-11-03 04:06:07,070 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:07,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:07,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:06:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849324804] [2022-11-03 04:06:07,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:06:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:07,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:06:07,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=367, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:06:07,075 INFO L87 Difference]: Start difference. First operand 7500 states and 29816 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:07,325 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse2 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) .cse2) 9223372039002259456)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:06:07,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (forall ((v_ArrVal_1307 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_86| Int) (v_ArrVal_1308 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_86|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_86| v_ArrVal_1307) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1308) c_~X_0~0.base) .cse1) 9223372039002259456)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:06:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:08,126 INFO L93 Difference]: Finished difference Result 13195 states and 52606 transitions. [2022-11-03 04:06:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:06:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:08,182 INFO L225 Difference]: With dead ends: 13195 [2022-11-03 04:06:08,182 INFO L226 Difference]: Without dead ends: 13163 [2022-11-03 04:06:08,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=520, Unknown=6, NotChecked=306, Total=930 [2022-11-03 04:06:08,183 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 163 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:08,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 177 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1000 Invalid, 0 Unknown, 512 Unchecked, 0.7s Time] [2022-11-03 04:06:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2022-11-03 04:06:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 8444. [2022-11-03 04:06:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8444 states, 8365 states have (on average 4.098266586969515) internal successors, (34282), 8443 states have internal predecessors, (34282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 34282 transitions. [2022-11-03 04:06:08,504 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 34282 transitions. Word has length 14 [2022-11-03 04:06:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:08,504 INFO L495 AbstractCegarLoop]: Abstraction has 8444 states and 34282 transitions. [2022-11-03 04:06:08,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 34282 transitions. [2022-11-03 04:06:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:08,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:08,505 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:08,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:08,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-03 04:06:08,706 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2129593774, now seen corresponding path program 1 times [2022-11-03 04:06:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:08,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024252060] [2022-11-03 04:06:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:08,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:09,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024252060] [2022-11-03 04:06:09,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024252060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:09,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194728643] [2022-11-03 04:06:09,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:09,158 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:09,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 04:06:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:09,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:06:09,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:09,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:09,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:09,463 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:06:09,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:06:09,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:09,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:09,644 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:06:09,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:06:09,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:09,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:09,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:09,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:09,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1364 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1364) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 04:06:09,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1363 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1363) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1364) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 04:06:10,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:10,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:06:10,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:10,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:06:10,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 122 [2022-11-03 04:06:10,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:06:10,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 54 [2022-11-03 04:06:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:10,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194728643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1370364380] [2022-11-03 04:06:10,339 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:10,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:10,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:06:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080033033] [2022-11-03 04:06:10,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:10,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:06:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:06:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=470, Unknown=3, NotChecked=90, Total=650 [2022-11-03 04:06:10,342 INFO L87 Difference]: Start difference. First operand 8444 states and 34282 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:11,467 INFO L93 Difference]: Finished difference Result 8780 states and 35382 transitions. [2022-11-03 04:06:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:06:11,468 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 04:06:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:11,504 INFO L225 Difference]: With dead ends: 8780 [2022-11-03 04:06:11,504 INFO L226 Difference]: Without dead ends: 8780 [2022-11-03 04:06:11,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=857, Unknown=3, NotChecked=126, Total=1190 [2022-11-03 04:06:11,505 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 236 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:11,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 84 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 531 Invalid, 0 Unknown, 352 Unchecked, 0.5s Time] [2022-11-03 04:06:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8780 states. [2022-11-03 04:06:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8780 to 8526. [2022-11-03 04:06:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8526 states, 8447 states have (on average 4.118740381200427) internal successors, (34791), 8525 states have internal predecessors, (34791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8526 states to 8526 states and 34791 transitions. [2022-11-03 04:06:11,712 INFO L78 Accepts]: Start accepts. Automaton has 8526 states and 34791 transitions. Word has length 14 [2022-11-03 04:06:11,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:11,712 INFO L495 AbstractCegarLoop]: Abstraction has 8526 states and 34791 transitions. [2022-11-03 04:06:11,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8526 states and 34791 transitions. [2022-11-03 04:06:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:11,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:11,713 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:11,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:11,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 04:06:11,914 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:11,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2129593778, now seen corresponding path program 1 times [2022-11-03 04:06:11,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:11,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193300704] [2022-11-03 04:06:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:12,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193300704] [2022-11-03 04:06:12,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193300704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:12,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897132709] [2022-11-03 04:06:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:12,511 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:12,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 04:06:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:12,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 04:06:12,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:12,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:12,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:12,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:13,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:13,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:13,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:13,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:13,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:13,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-03 04:06:13,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-03 04:06:13,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-11-03 04:06:13,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1415) |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)))) is different from false [2022-11-03 04:06:13,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:06:13,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:13,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:06:13,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 119 [2022-11-03 04:06:13,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 214 [2022-11-03 04:06:13,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 198 [2022-11-03 04:06:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:13,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897132709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:13,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569278332] [2022-11-03 04:06:13,609 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:13,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:13,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:06:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029470005] [2022-11-03 04:06:13,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:13,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:06:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:06:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-11-03 04:06:13,611 INFO L87 Difference]: Start difference. First operand 8526 states and 34791 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:13,751 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1415 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1415) |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= (select .cse1 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (select .cse1 .cse0) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:06:15,755 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (+ c_~X_0~0.offset 4))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (select .cse0 .cse1) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select .cse0 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_90| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_90|)) (forall ((v_ArrVal_1417 (Array Int Int)) (v_ArrVal_1416 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_90| v_ArrVal_1416) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1417) c_~X_0~0.base) .cse1) 4294967296)))) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:06:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:16,330 INFO L93 Difference]: Finished difference Result 8617 states and 35007 transitions. [2022-11-03 04:06:16,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:06:16,331 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 04:06:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:16,361 INFO L225 Difference]: With dead ends: 8617 [2022-11-03 04:06:16,361 INFO L226 Difference]: Without dead ends: 8617 [2022-11-03 04:06:16,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=104, Invalid=514, Unknown=6, NotChecked=306, Total=930 [2022-11-03 04:06:16,362 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:16,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 110 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 736 Invalid, 0 Unknown, 251 Unchecked, 0.5s Time] [2022-11-03 04:06:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2022-11-03 04:06:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 8572. [2022-11-03 04:06:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8572 states, 8493 states have (on average 4.109619686800895) internal successors, (34903), 8571 states have internal predecessors, (34903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8572 states to 8572 states and 34903 transitions. [2022-11-03 04:06:16,560 INFO L78 Accepts]: Start accepts. Automaton has 8572 states and 34903 transitions. Word has length 14 [2022-11-03 04:06:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:16,560 INFO L495 AbstractCegarLoop]: Abstraction has 8572 states and 34903 transitions. [2022-11-03 04:06:16,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 8572 states and 34903 transitions. [2022-11-03 04:06:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:16,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:16,562 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:16,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-03 04:06:16,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 04:06:16,790 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2046992108, now seen corresponding path program 2 times [2022-11-03 04:06:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411399891] [2022-11-03 04:06:16,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:16,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:17,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411399891] [2022-11-03 04:06:17,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411399891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:17,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812872031] [2022-11-03 04:06:17,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:06:17,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:17,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:17,246 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:17,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 04:06:17,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:06:17,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:17,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 04:06:17,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:17,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:17,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:17,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:17,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:17,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:17,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:17,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:17,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:17,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 4294967296)) is different from false [2022-11-03 04:06:17,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-03 04:06:17,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-11-03 04:06:17,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_92| Int)) (or (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |v_thread1Thread1of1ForFork2_~#t2~0.base_92| v_ArrVal_1470) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_92|)))) is different from false [2022-11-03 04:06:17,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1468 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_92| Int) (v_ArrVal_1470 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1469) |v_thread1Thread1of1ForFork2_~#t2~0.base_92| v_ArrVal_1470) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_92|)))) is different from false [2022-11-03 04:06:17,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:06:17,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 135 [2022-11-03 04:06:17,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:06:17,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 98 [2022-11-03 04:06:17,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-11-03 04:06:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:18,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812872031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:18,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298124721] [2022-11-03 04:06:18,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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:18,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:18,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:06:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860133005] [2022-11-03 04:06:18,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:18,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:06:18,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:06:18,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=372, Unknown=5, NotChecked=210, Total=650 [2022-11-03 04:06:18,135 INFO L87 Difference]: Start difference. First operand 8572 states and 34903 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:53,455 INFO L93 Difference]: Finished difference Result 8774 states and 35104 transitions. [2022-11-03 04:06:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:06:53,455 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 04:06:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:53,482 INFO L225 Difference]: With dead ends: 8774 [2022-11-03 04:06:53,482 INFO L226 Difference]: Without dead ends: 8774 [2022-11-03 04:06:53,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=20, NotChecked=300, Total=1190 [2022-11-03 04:06:53,483 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 243 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:53,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 84 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 753 Invalid, 0 Unknown, 393 Unchecked, 0.6s Time] [2022-11-03 04:06:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8774 states. [2022-11-03 04:06:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8774 to 8466. [2022-11-03 04:06:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 8387 states have (on average 4.097889591033742) internal successors, (34369), 8465 states have internal predecessors, (34369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 34369 transitions. [2022-11-03 04:06:53,664 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 34369 transitions. Word has length 14 [2022-11-03 04:06:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:53,665 INFO L495 AbstractCegarLoop]: Abstraction has 8466 states and 34369 transitions. [2022-11-03 04:06:53,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 34369 transitions. [2022-11-03 04:06:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:53,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:53,667 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:53,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-03 04:06:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-03 04:06:53,867 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2044702903, now seen corresponding path program 2 times [2022-11-03 04:06:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260798850] [2022-11-03 04:06:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:54,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260798850] [2022-11-03 04:06:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260798850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664490385] [2022-11-03 04:06:54,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:06:54,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:54,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:54,335 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:54,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 04:06:54,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:06:54,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:54,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 04:06:54,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:54,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:54,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:54,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:54,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:54,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:54,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:54,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:06:54,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:06:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:54,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:55,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:06:55,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:06:55,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_94| Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |v_thread1Thread1of1ForFork2_~#t2~0.base_94| v_ArrVal_1523) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_94|)))) is different from false [2022-11-03 04:06:55,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1522 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_94| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1521) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1522) |v_thread1Thread1of1ForFork2_~#t2~0.base_94| v_ArrVal_1523) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_94|)))) is different from false [2022-11-03 04:06:55,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:55,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:06:55,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:55,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:06:55,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 246 [2022-11-03 04:06:55,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 214 [2022-11-03 04:06:55,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 198 [2022-11-03 04:06:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:55,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664490385] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:55,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1435215463] [2022-11-03 04:06:55,350 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:55,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:55,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:06:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397662723] [2022-11-03 04:06:55,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:55,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:06:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:55,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:06:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:06:55,352 INFO L87 Difference]: Start difference. First operand 8466 states and 34369 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:56,513 INFO L93 Difference]: Finished difference Result 11633 states and 46651 transitions. [2022-11-03 04:06:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:06:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:56,569 INFO L225 Difference]: With dead ends: 11633 [2022-11-03 04:06:56,569 INFO L226 Difference]: Without dead ends: 11601 [2022-11-03 04:06:56,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=728, Unknown=4, NotChecked=236, Total=1122 [2022-11-03 04:06:56,570 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 363 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 425 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:56,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 59 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 570 Invalid, 0 Unknown, 425 Unchecked, 0.5s Time] [2022-11-03 04:06:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11601 states. [2022-11-03 04:06:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11601 to 8313. [2022-11-03 04:06:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8313 states, 8234 states have (on average 4.104687879523925) internal successors, (33798), 8312 states have internal predecessors, (33798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8313 states to 8313 states and 33798 transitions. [2022-11-03 04:06:56,772 INFO L78 Accepts]: Start accepts. Automaton has 8313 states and 33798 transitions. Word has length 14 [2022-11-03 04:06:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:56,772 INFO L495 AbstractCegarLoop]: Abstraction has 8313 states and 33798 transitions. [2022-11-03 04:06:56,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8313 states and 33798 transitions. [2022-11-03 04:06:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:56,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:56,773 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:56,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:56,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-03 04:06:56,978 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:06:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash -514433224, now seen corresponding path program 2 times [2022-11-03 04:06:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:56,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510272623] [2022-11-03 04:06:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:57,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:57,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510272623] [2022-11-03 04:06:57,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510272623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:57,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310360305] [2022-11-03 04:06:57,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:06:57,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:57,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:57,427 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:57,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 04:06:57,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:06:57,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:57,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 04:06:57,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:57,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:06:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:57,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:57,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:57,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:57,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:57,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:06:58,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:06:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:58,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:58,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1576 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:06:58,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-03 04:06:58,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1575 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1575) |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)))) is different from false [2022-11-03 04:06:58,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int)) (v_ArrVal_1575 (Array Int Int)) (v_ArrVal_1574 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1575) |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)))) is different from false [2022-11-03 04:06:58,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:58,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:06:58,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:58,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:06:58,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 66 [2022-11-03 04:06:58,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 [2022-11-03 04:06:58,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-11-03 04:06:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:06:58,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310360305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1473574075] [2022-11-03 04:06:58,370 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:06:58,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:58,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:06:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652799559] [2022-11-03 04:06:58,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:58,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:06:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:06:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=368, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:06:58,372 INFO L87 Difference]: Start difference. First operand 8313 states and 33798 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:58,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| c_~X_0~0.base)) (.cse2 (+ c_~X_0~0.offset 4))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse1 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_96| Int) (v_ArrVal_1576 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_96|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_96| v_ArrVal_1576) c_~X_0~0.base) .cse2) 9223372039002259456)))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= 0 (+ (select .cse1 .cse2) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:06:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:59,563 INFO L93 Difference]: Finished difference Result 14952 states and 59478 transitions. [2022-11-03 04:06:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:06:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:59,617 INFO L225 Difference]: With dead ends: 14952 [2022-11-03 04:06:59,617 INFO L226 Difference]: Without dead ends: 14920 [2022-11-03 04:06:59,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=775, Unknown=5, NotChecked=310, Total=1260 [2022-11-03 04:06:59,618 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 521 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:59,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 93 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 677 Invalid, 0 Unknown, 516 Unchecked, 0.6s Time] [2022-11-03 04:06:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14920 states. [2022-11-03 04:06:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14920 to 8233. [2022-11-03 04:06:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8233 states, 8154 states have (on average 4.106205543291636) internal successors, (33482), 8232 states have internal predecessors, (33482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 33482 transitions. [2022-11-03 04:06:59,837 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 33482 transitions. Word has length 14 [2022-11-03 04:06:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:59,837 INFO L495 AbstractCegarLoop]: Abstraction has 8233 states and 33482 transitions. [2022-11-03 04:06:59,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:06:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 33482 transitions. [2022-11-03 04:06:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:59,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:59,838 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:59,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:00,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-03 04:07:00,039 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:00,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1067089296, now seen corresponding path program 1 times [2022-11-03 04:07:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:00,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583824875] [2022-11-03 04:07:00,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:00,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:00,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583824875] [2022-11-03 04:07:00,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583824875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:00,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899557378] [2022-11-03 04:07:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:00,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:00,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:00,439 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:00,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 04:07:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:00,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:00,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:00,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:00,684 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:00,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:00,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:00,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:00,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:00,837 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:00,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:00,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:00,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:00,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:00,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:07:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:00,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:01,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1632) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:01,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1632 (Array Int Int)) (v_ArrVal_1631 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1631) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1632) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:01,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:01,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:07:01,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:01,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:07:01,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 222 [2022-11-03 04:07:01,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 214 [2022-11-03 04:07:01,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 214 treesize of output 198 [2022-11-03 04:07:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:01,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899557378] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854065071] [2022-11-03 04:07:01,568 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:01,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:01,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792746609] [2022-11-03 04:07:01,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:01,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=444, Unknown=3, NotChecked=86, Total=600 [2022-11-03 04:07:01,570 INFO L87 Difference]: Start difference. First operand 8233 states and 33482 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:02,625 INFO L93 Difference]: Finished difference Result 14421 states and 58176 transitions. [2022-11-03 04:07:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:07:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:02,679 INFO L225 Difference]: With dead ends: 14421 [2022-11-03 04:07:02,679 INFO L226 Difference]: Without dead ends: 14421 [2022-11-03 04:07:02,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=845, Unknown=3, NotChecked=122, Total=1122 [2022-11-03 04:07:02,680 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:02,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 160 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 675 Invalid, 0 Unknown, 559 Unchecked, 0.5s Time] [2022-11-03 04:07:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14421 states. [2022-11-03 04:07:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14421 to 8450. [2022-11-03 04:07:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8450 states, 8371 states have (on average 4.115756779357305) internal successors, (34453), 8449 states have internal predecessors, (34453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 34453 transitions. [2022-11-03 04:07:03,006 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 34453 transitions. Word has length 14 [2022-11-03 04:07:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:03,006 INFO L495 AbstractCegarLoop]: Abstraction has 8450 states and 34453 transitions. [2022-11-03 04:07:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 34453 transitions. [2022-11-03 04:07:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:07:03,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:03,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:03,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:03,238 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1067089293, now seen corresponding path program 1 times [2022-11-03 04:07:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073764809] [2022-11-03 04:07:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:03,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:03,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073764809] [2022-11-03 04:07:03,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073764809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:03,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000533921] [2022-11-03 04:07:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:03,644 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:03,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 04:07:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:03,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:03,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:03,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:03,891 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:03,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:03,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:03,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:03,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:04,027 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:04,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:04,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:04,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:04,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:04,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:07:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:04,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:04,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1688) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:04,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1687) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1688) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:04,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:04,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:07:04,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:04,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-03 04:07:04,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 291 treesize of output 259 [2022-11-03 04:07:04,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 550 treesize of output 486 [2022-11-03 04:07:04,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 486 treesize of output 470 [2022-11-03 04:07:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000533921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1194411327] [2022-11-03 04:07:05,055 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:05,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:05,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114799194] [2022-11-03 04:07:05,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=439, Unknown=3, NotChecked=86, Total=600 [2022-11-03 04:07:05,057 INFO L87 Difference]: Start difference. First operand 8450 states and 34453 transitions. Second operand has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:05,806 INFO L93 Difference]: Finished difference Result 10961 states and 43735 transitions. [2022-11-03 04:07:05,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:07:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:05,844 INFO L225 Difference]: With dead ends: 10961 [2022-11-03 04:07:05,844 INFO L226 Difference]: Without dead ends: 10941 [2022-11-03 04:07:05,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=742, Unknown=3, NotChecked=114, Total=992 [2022-11-03 04:07:05,845 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 221 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:05,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 127 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 482 Invalid, 0 Unknown, 469 Unchecked, 0.4s Time] [2022-11-03 04:07:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10941 states. [2022-11-03 04:07:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10941 to 8480. [2022-11-03 04:07:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8480 states, 8401 states have (on average 4.118914414950601) internal successors, (34603), 8479 states have internal predecessors, (34603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 34603 transitions. [2022-11-03 04:07:06,032 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 34603 transitions. Word has length 14 [2022-11-03 04:07:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:06,032 INFO L495 AbstractCegarLoop]: Abstraction has 8480 states and 34603 transitions. [2022-11-03 04:07:06,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 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-03 04:07:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 34603 transitions. [2022-11-03 04:07:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:06,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:06,034 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:06,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:06,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:06,250 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:06,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:06,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1185185780, now seen corresponding path program 3 times [2022-11-03 04:07:06,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:06,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9606446] [2022-11-03 04:07:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:06,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9606446] [2022-11-03 04:07:06,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9606446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704294861] [2022-11-03 04:07:06,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:07:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:06,759 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:06,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 04:07:07,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:07:07,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:07,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:07:07,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:07,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:07,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:07,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:07,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:07,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:07,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:07,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1734) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2022-11-03 04:07:07,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1733 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1733) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1734) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 04:07:07,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:07,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:07:07,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:07,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-03 04:07:07,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:07,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:07:07,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704294861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:07,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1124538376] [2022-11-03 04:07:07,857 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:07,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:07:07,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107766514] [2022-11-03 04:07:07,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:07,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:07:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:07:07,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=783, Unknown=2, NotChecked=114, Total=992 [2022-11-03 04:07:07,859 INFO L87 Difference]: Start difference. First operand 8480 states and 34603 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:09,664 INFO L93 Difference]: Finished difference Result 9138 states and 36259 transitions. [2022-11-03 04:07:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:07:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:09,703 INFO L225 Difference]: With dead ends: 9138 [2022-11-03 04:07:09,703 INFO L226 Difference]: Without dead ends: 9138 [2022-11-03 04:07:09,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=1319, Unknown=2, NotChecked=150, Total=1640 [2022-11-03 04:07:09,704 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 315 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:09,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 235 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1556 Invalid, 0 Unknown, 249 Unchecked, 1.2s Time] [2022-11-03 04:07:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9138 states. [2022-11-03 04:07:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9138 to 8490. [2022-11-03 04:07:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8490 states, 8411 states have (on average 4.1193674949470935) internal successors, (34648), 8489 states have internal predecessors, (34648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8490 states to 8490 states and 34648 transitions. [2022-11-03 04:07:09,916 INFO L78 Accepts]: Start accepts. Automaton has 8490 states and 34648 transitions. Word has length 15 [2022-11-03 04:07:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:09,917 INFO L495 AbstractCegarLoop]: Abstraction has 8490 states and 34648 transitions. [2022-11-03 04:07:09,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8490 states and 34648 transitions. [2022-11-03 04:07:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:09,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:09,918 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:09,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:10,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-03 04:07:10,119 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1185185776, now seen corresponding path program 2 times [2022-11-03 04:07:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:10,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523780791] [2022-11-03 04:07:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:10,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:10,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523780791] [2022-11-03 04:07:10,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523780791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:10,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550814125] [2022-11-03 04:07:10,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:10,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:10,669 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:10,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 04:07:11,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:11,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:11,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:11,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:11,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:07:11,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:11,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:11,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:11,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:11,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:11,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:11,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:07:11,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:11,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 80 [2022-11-03 04:07:11,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 49 [2022-11-03 04:07:11,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 20 [2022-11-03 04:07:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:12,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550814125] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:12,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1086063598] [2022-11-03 04:07:12,411 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:12,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:12,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:07:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136115150] [2022-11-03 04:07:12,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:12,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:07:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:07:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=872, Unknown=6, NotChecked=0, Total=992 [2022-11-03 04:07:12,415 INFO L87 Difference]: Start difference. First operand 8490 states and 34648 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:13,129 INFO L93 Difference]: Finished difference Result 8501 states and 34681 transitions. [2022-11-03 04:07:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:07:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:13,158 INFO L225 Difference]: With dead ends: 8501 [2022-11-03 04:07:13,158 INFO L226 Difference]: Without dead ends: 8501 [2022-11-03 04:07:13,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=201, Invalid=1515, Unknown=6, NotChecked=0, Total=1722 [2022-11-03 04:07:13,159 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:13,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 121 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 322 Invalid, 0 Unknown, 107 Unchecked, 0.2s Time] [2022-11-03 04:07:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8501 states. [2022-11-03 04:07:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8501 to 8501. [2022-11-03 04:07:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8422 states have (on average 4.117905485632867) internal successors, (34681), 8500 states have internal predecessors, (34681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 34681 transitions. [2022-11-03 04:07:13,322 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 34681 transitions. Word has length 15 [2022-11-03 04:07:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:13,323 INFO L495 AbstractCegarLoop]: Abstraction has 8501 states and 34681 transitions. [2022-11-03 04:07:13,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 34681 transitions. [2022-11-03 04:07:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:13,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:13,324 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:13,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:13,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-03 04:07:13,530 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1359037020, now seen corresponding path program 2 times [2022-11-03 04:07:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:13,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518264931] [2022-11-03 04:07:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:14,108 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-03 04:07:14,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:14,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518264931] [2022-11-03 04:07:14,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518264931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:14,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921021537] [2022-11-03 04:07:14,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:14,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:14,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:14,110 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:14,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 04:07:14,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:14,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:14,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:07:14,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:14,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:14,552 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:14,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:14,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:14,692 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:07:14,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 04:07:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:14,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:14,770 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:14,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:14,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:14,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:07:14,888 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-03 04:07:14,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:15,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1841 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1841) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:15,179 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:07:15,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 04:07:15,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:15,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:07:15,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:15,453 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-03 04:07:15,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921021537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:15,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [332456271] [2022-11-03 04:07:15,453 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:15,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:15,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:07:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107389031] [2022-11-03 04:07:15,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:07:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:07:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=4, NotChecked=56, Total=930 [2022-11-03 04:07:15,455 INFO L87 Difference]: Start difference. First operand 8501 states and 34681 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:17,365 INFO L93 Difference]: Finished difference Result 12131 states and 49071 transitions. [2022-11-03 04:07:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 04:07:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:17,413 INFO L225 Difference]: With dead ends: 12131 [2022-11-03 04:07:17,413 INFO L226 Difference]: Without dead ends: 12131 [2022-11-03 04:07:17,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=4, NotChecked=92, Total=2352 [2022-11-03 04:07:17,414 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 377 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1080 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:17,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 275 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1062 Invalid, 0 Unknown, 1080 Unchecked, 0.8s Time] [2022-11-03 04:07:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12131 states. [2022-11-03 04:07:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12131 to 8582. [2022-11-03 04:07:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8582 states, 8503 states have (on average 4.121486534164412) internal successors, (35045), 8581 states have internal predecessors, (35045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8582 states to 8582 states and 35045 transitions. [2022-11-03 04:07:17,655 INFO L78 Accepts]: Start accepts. Automaton has 8582 states and 35045 transitions. Word has length 15 [2022-11-03 04:07:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:17,655 INFO L495 AbstractCegarLoop]: Abstraction has 8582 states and 35045 transitions. [2022-11-03 04:07:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states and 35045 transitions. [2022-11-03 04:07:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:17,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:17,656 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:17,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:17,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:17,857 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1359037023, now seen corresponding path program 2 times [2022-11-03 04:07:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:17,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924196038] [2022-11-03 04:07:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:18,417 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-03 04:07:18,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924196038] [2022-11-03 04:07:18,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924196038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576113656] [2022-11-03 04:07:18,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:18,420 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:18,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 04:07:18,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:18,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:18,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:07:18,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:18,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:18,840 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:18,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:18,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:18,978 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:07:18,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2022-11-03 04:07:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:19,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:19,073 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:19,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:19,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:19,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:07:19,192 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-03 04:07:19,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:19,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1902 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1902) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:19,454 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:07:19,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 04:07:19,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:19,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-03 04:07:19,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:19,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:19,669 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-03 04:07:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576113656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:19,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1936264267] [2022-11-03 04:07:19,670 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:19,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:19,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:07:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354611942] [2022-11-03 04:07:19,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:19,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:07:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:07:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=4, NotChecked=56, Total=930 [2022-11-03 04:07:19,672 INFO L87 Difference]: Start difference. First operand 8582 states and 35045 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:20,938 INFO L93 Difference]: Finished difference Result 12088 states and 48299 transitions. [2022-11-03 04:07:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:07:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:20,978 INFO L225 Difference]: With dead ends: 12088 [2022-11-03 04:07:20,978 INFO L226 Difference]: Without dead ends: 12080 [2022-11-03 04:07:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=222, Invalid=1670, Unknown=4, NotChecked=84, Total=1980 [2022-11-03 04:07:20,979 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 348 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:20,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 215 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 744 Invalid, 0 Unknown, 655 Unchecked, 0.6s Time] [2022-11-03 04:07:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12080 states. [2022-11-03 04:07:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12080 to 8552. [2022-11-03 04:07:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8552 states, 8473 states have (on average 4.115543491089342) internal successors, (34871), 8551 states have internal predecessors, (34871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8552 states to 8552 states and 34871 transitions. [2022-11-03 04:07:21,167 INFO L78 Accepts]: Start accepts. Automaton has 8552 states and 34871 transitions. Word has length 15 [2022-11-03 04:07:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:21,167 INFO L495 AbstractCegarLoop]: Abstraction has 8552 states and 34871 transitions. [2022-11-03 04:07:21,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8552 states and 34871 transitions. [2022-11-03 04:07:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:21,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:21,168 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:21,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-03 04:07:21,378 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1594684341, now seen corresponding path program 2 times [2022-11-03 04:07:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814267201] [2022-11-03 04:07:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:21,775 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-03 04:07:21,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814267201] [2022-11-03 04:07:21,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814267201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847968229] [2022-11-03 04:07:21,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:21,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:21,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:21,777 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:21,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 04:07:22,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:22,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:22,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 04:07:22,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:22,085 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:22,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:22,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:22,196 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:07:22,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:07:22,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:22,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:22,290 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:22,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:22,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:22,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:22,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:22,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:07:22,437 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-03 04:07:22,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:22,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1964 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:22,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1963) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1964) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:22,751 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:07:22,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-11-03 04:07:22,765 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:22,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:07:22,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 254 [2022-11-03 04:07:22,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 246 [2022-11-03 04:07:22,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2022-11-03 04:07:23,157 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-03 04:07:23,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847968229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:23,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1206375839] [2022-11-03 04:07:23,158 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:23,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:23,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 04:07:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269280758] [2022-11-03 04:07:23,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:23,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:07:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:07:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=569, Unknown=5, NotChecked=98, Total=756 [2022-11-03 04:07:23,161 INFO L87 Difference]: Start difference. First operand 8552 states and 34871 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:24,009 INFO L93 Difference]: Finished difference Result 14041 states and 56547 transitions. [2022-11-03 04:07:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:07:24,010 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:24,057 INFO L225 Difference]: With dead ends: 14041 [2022-11-03 04:07:24,058 INFO L226 Difference]: Without dead ends: 14033 [2022-11-03 04:07:24,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=908, Unknown=5, NotChecked=126, Total=1190 [2022-11-03 04:07:24,058 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 342 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:24,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 99 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 535 Invalid, 0 Unknown, 524 Unchecked, 0.4s Time] [2022-11-03 04:07:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14033 states. [2022-11-03 04:07:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14033 to 9057. [2022-11-03 04:07:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9057 states, 8978 states have (on average 4.188460681666295) internal successors, (37604), 9056 states have internal predecessors, (37604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9057 states to 9057 states and 37604 transitions. [2022-11-03 04:07:24,300 INFO L78 Accepts]: Start accepts. Automaton has 9057 states and 37604 transitions. Word has length 15 [2022-11-03 04:07:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:24,300 INFO L495 AbstractCegarLoop]: Abstraction has 9057 states and 37604 transitions. [2022-11-03 04:07:24,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 9057 states and 37604 transitions. [2022-11-03 04:07:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:24,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:24,302 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:24,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-03 04:07:24,503 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:24,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1797137312, now seen corresponding path program 1 times [2022-11-03 04:07:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:24,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29261067] [2022-11-03 04:07:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:24,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:24,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:24,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29261067] [2022-11-03 04:07:24,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29261067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:24,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515213275] [2022-11-03 04:07:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:24,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:24,948 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:24,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 04:07:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:25,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:25,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:25,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:25,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:25,256 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:07:25,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:07:25,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:25,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:25,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:25,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:25,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:25,450 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:25,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:25,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:25,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:07:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:25,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:25,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2020 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2020) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:25,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:25,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:07:25,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:25,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:07:25,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 66 [2022-11-03 04:07:25,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 [2022-11-03 04:07:25,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-11-03 04:07:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515213275] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286975838] [2022-11-03 04:07:26,111 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:26,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:26,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135531935] [2022-11-03 04:07:26,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=4, NotChecked=44, Total=600 [2022-11-03 04:07:26,112 INFO L87 Difference]: Start difference. First operand 9057 states and 37604 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:26,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:26,884 INFO L93 Difference]: Finished difference Result 12452 states and 49924 transitions. [2022-11-03 04:07:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:07:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:26,935 INFO L225 Difference]: With dead ends: 12452 [2022-11-03 04:07:26,935 INFO L226 Difference]: Without dead ends: 12420 [2022-11-03 04:07:26,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=4, NotChecked=56, Total=930 [2022-11-03 04:07:26,936 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 235 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:26,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 68 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 399 Unchecked, 0.4s Time] [2022-11-03 04:07:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2022-11-03 04:07:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 8027. [2022-11-03 04:07:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8027 states, 7948 states have (on average 4.138273779567187) internal successors, (32891), 8026 states have internal predecessors, (32891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8027 states to 8027 states and 32891 transitions. [2022-11-03 04:07:27,148 INFO L78 Accepts]: Start accepts. Automaton has 8027 states and 32891 transitions. Word has length 15 [2022-11-03 04:07:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 8027 states and 32891 transitions. [2022-11-03 04:07:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8027 states and 32891 transitions. [2022-11-03 04:07:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:27,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:27,149 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:27,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:27,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-03 04:07:27,350 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1922952301, now seen corresponding path program 1 times [2022-11-03 04:07:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:27,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601820894] [2022-11-03 04:07:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:27,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601820894] [2022-11-03 04:07:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601820894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038784293] [2022-11-03 04:07:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:27,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:27,690 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:27,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 04:07:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:28,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:07:28,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:28,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,024 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:28,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:28,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:28,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:28,155 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:28,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 04:07:28,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:28,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 04:07:28,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:28,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:07:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:28,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:28,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2078 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2078) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:28,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2078 (Array Int Int)) (v_ArrVal_2077 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2077) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2078) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:28,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_120| Int) (v_ArrVal_2078 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_112| Int) (v_ArrVal_2077 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_112|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| v_ArrVal_2077) |v_thread1Thread1of1ForFork2_~#t3~0.base_120| v_ArrVal_2078) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_120|) 0)))) is different from false [2022-11-03 04:07:28,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_120| Int) (v_ArrVal_2078 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_112| Int) (v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2074 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_112|)) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_112| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_120|) 0)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2074) |v_thread1Thread1of1ForFork2_~#t2~0.base_112| v_ArrVal_2077) |v_thread1Thread1of1ForFork2_~#t3~0.base_120| v_ArrVal_2078) |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-03 04:07:28,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:28,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:07:28,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:28,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 553 treesize of output 531 [2022-11-03 04:07:28,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 454 [2022-11-03 04:07:28,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 235 treesize of output 219 [2022-11-03 04:07:28,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 438 treesize of output 406 [2022-11-03 04:07:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:07:28,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038784293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:28,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [610109144] [2022-11-03 04:07:28,939 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:28,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:28,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238150183] [2022-11-03 04:07:28,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:28,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=365, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:07:28,942 INFO L87 Difference]: Start difference. First operand 8027 states and 32891 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:30,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:30,183 INFO L93 Difference]: Finished difference Result 12372 states and 48374 transitions. [2022-11-03 04:07:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 04:07:30,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:30,231 INFO L225 Difference]: With dead ends: 12372 [2022-11-03 04:07:30,231 INFO L226 Difference]: Without dead ends: 12352 [2022-11-03 04:07:30,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=877, Unknown=6, NotChecked=260, Total=1332 [2022-11-03 04:07:30,232 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 395 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:30,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 94 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 660 Invalid, 0 Unknown, 705 Unchecked, 0.6s Time] [2022-11-03 04:07:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12352 states. [2022-11-03 04:07:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12352 to 7200. [2022-11-03 04:07:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7200 states, 7121 states have (on average 4.044797079061929) internal successors, (28803), 7199 states have internal predecessors, (28803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7200 states to 7200 states and 28803 transitions. [2022-11-03 04:07:30,430 INFO L78 Accepts]: Start accepts. Automaton has 7200 states and 28803 transitions. Word has length 15 [2022-11-03 04:07:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:30,430 INFO L495 AbstractCegarLoop]: Abstraction has 7200 states and 28803 transitions. [2022-11-03 04:07:30,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7200 states and 28803 transitions. [2022-11-03 04:07:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:30,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:30,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:30,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:30,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:30,632 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:30,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1280120135, now seen corresponding path program 1 times [2022-11-03 04:07:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364437156] [2022-11-03 04:07:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:31,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364437156] [2022-11-03 04:07:31,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364437156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887005083] [2022-11-03 04:07:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:31,052 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:31,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 04:07:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:31,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:07:31,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,361 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:31,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:31,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:31,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:31,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:31,498 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:07:31,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:07:31,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:31,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:31,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:07:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:31,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:31,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2136 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2136) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:31,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2135 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2135) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2136) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:31,873 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:31,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:07:31,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:31,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1235 treesize of output 1189 [2022-11-03 04:07:31,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1174 treesize of output 1142 [2022-11-03 04:07:31,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1142 treesize of output 1078 [2022-11-03 04:07:31,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 950 [2022-11-03 04:07:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:33,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887005083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:33,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2044548828] [2022-11-03 04:07:33,464 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:33,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:33,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047549005] [2022-11-03 04:07:33,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:33,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:33,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:33,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=437, Unknown=3, NotChecked=86, Total=600 [2022-11-03 04:07:33,467 INFO L87 Difference]: Start difference. First operand 7200 states and 28803 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:34,110 INFO L93 Difference]: Finished difference Result 9127 states and 36337 transitions. [2022-11-03 04:07:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:07:34,111 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:34,140 INFO L225 Difference]: With dead ends: 9127 [2022-11-03 04:07:34,140 INFO L226 Difference]: Without dead ends: 9127 [2022-11-03 04:07:34,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=688, Unknown=3, NotChecked=110, Total=930 [2022-11-03 04:07:34,141 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 239 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:34,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 90 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 390 Invalid, 0 Unknown, 572 Unchecked, 0.3s Time] [2022-11-03 04:07:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2022-11-03 04:07:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7270. [2022-11-03 04:07:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 7191 states have (on average 4.0506188290919205) internal successors, (29128), 7269 states have internal predecessors, (29128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 29128 transitions. [2022-11-03 04:07:34,387 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 29128 transitions. Word has length 15 [2022-11-03 04:07:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:34,387 INFO L495 AbstractCegarLoop]: Abstraction has 7270 states and 29128 transitions. [2022-11-03 04:07:34,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 29128 transitions. [2022-11-03 04:07:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:07:34,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:34,389 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:34,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:34,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-11-03 04:07:34,594 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1280120132, now seen corresponding path program 1 times [2022-11-03 04:07:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:34,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085117357] [2022-11-03 04:07:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:34,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:34,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085117357] [2022-11-03 04:07:34,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085117357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:34,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028964338] [2022-11-03 04:07:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:34,989 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:35,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 04:07:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:35,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:35,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:35,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,331 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:07:35,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:07:35,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:35,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:35,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:35,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:35,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:35,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:35,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:07:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:35,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:35,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2192) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:35,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2191) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2192) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:07:35,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:35,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:07:35,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:35,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:07:35,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 119 [2022-11-03 04:07:35,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2022-11-03 04:07:35,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 230 treesize of output 198 [2022-11-03 04:07:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:36,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028964338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:36,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [603721935] [2022-11-03 04:07:36,149 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:36,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:36,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 04:07:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205670665] [2022-11-03 04:07:36,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:36,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 04:07:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 04:07:36,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=444, Unknown=3, NotChecked=86, Total=600 [2022-11-03 04:07:36,151 INFO L87 Difference]: Start difference. First operand 7270 states and 29128 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:37,092 INFO L93 Difference]: Finished difference Result 11029 states and 43976 transitions. [2022-11-03 04:07:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:07:37,093 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:07:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:37,133 INFO L225 Difference]: With dead ends: 11029 [2022-11-03 04:07:37,133 INFO L226 Difference]: Without dead ends: 11001 [2022-11-03 04:07:37,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=841, Unknown=3, NotChecked=122, Total=1122 [2022-11-03 04:07:37,134 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 306 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:37,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 86 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 531 Invalid, 0 Unknown, 533 Unchecked, 0.5s Time] [2022-11-03 04:07:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11001 states. [2022-11-03 04:07:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11001 to 7983. [2022-11-03 04:07:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 7904 states have (on average 4.14827935222672) internal successors, (32788), 7982 states have internal predecessors, (32788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 32788 transitions. [2022-11-03 04:07:37,316 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 32788 transitions. Word has length 15 [2022-11-03 04:07:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:37,317 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 32788 transitions. [2022-11-03 04:07:37,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 32788 transitions. [2022-11-03 04:07:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:07:37,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:37,318 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:37,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:37,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-11-03 04:07:37,519 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2009608472, now seen corresponding path program 3 times [2022-11-03 04:07:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:37,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938553126] [2022-11-03 04:07:37,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:37,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:38,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938553126] [2022-11-03 04:07:38,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938553126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:38,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5750695] [2022-11-03 04:07:38,142 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:07:38,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:38,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:38,147 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:38,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 04:07:38,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:07:38,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:38,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:07:38,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:38,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:38,713 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:07:38,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-11-03 04:07:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:38,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:38,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:38,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:38,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:39,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2244 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2244) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)) is different from false [2022-11-03 04:07:39,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2243) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2244) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 04:07:39,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2241 Int) (v_ArrVal_2244 (Array Int Int)) (v_ArrVal_2243 (Array Int Int))) (< (select (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~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2241)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2243) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2244) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 04:07:39,148 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:07:39,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 04:07:39,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:39,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:07:39,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 51 [2022-11-03 04:07:39,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 94 [2022-11-03 04:07:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 04:07:39,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5750695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:39,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146504585] [2022-11-03 04:07:39,359 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:39,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:39,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 04:07:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870734306] [2022-11-03 04:07:39,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:39,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:07:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:07:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=900, Unknown=3, NotChecked=186, Total=1190 [2022-11-03 04:07:39,361 INFO L87 Difference]: Start difference. First operand 7983 states and 32788 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:41,168 INFO L93 Difference]: Finished difference Result 8617 states and 34366 transitions. [2022-11-03 04:07:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:07:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:07:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:41,200 INFO L225 Difference]: With dead ends: 8617 [2022-11-03 04:07:41,200 INFO L226 Difference]: Without dead ends: 8617 [2022-11-03 04:07:41,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=1462, Unknown=3, NotChecked=240, Total=1892 [2022-11-03 04:07:41,201 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 290 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:41,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 318 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1900 Invalid, 0 Unknown, 369 Unchecked, 1.2s Time] [2022-11-03 04:07:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8617 states. [2022-11-03 04:07:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8617 to 7983. [2022-11-03 04:07:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 7904 states have (on average 4.14752024291498) internal successors, (32782), 7982 states have internal predecessors, (32782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 32782 transitions. [2022-11-03 04:07:41,386 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 32782 transitions. Word has length 16 [2022-11-03 04:07:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:41,387 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 32782 transitions. [2022-11-03 04:07:41,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 32782 transitions. [2022-11-03 04:07:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:07:41,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:41,388 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:41,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:41,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:41,589 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1913947843, now seen corresponding path program 4 times [2022-11-03 04:07:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:41,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499798937] [2022-11-03 04:07:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:41,858 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-03 04:07:41,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499798937] [2022-11-03 04:07:41,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499798937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:41,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036367019] [2022-11-03 04:07:41,859 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:07:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:41,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:41,861 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:41,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 04:07:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:42,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 04:07:42,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:42,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:42,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036367019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236364712] [2022-11-03 04:07:42,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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:42,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:42,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-03 04:07:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763557772] [2022-11-03 04:07:42,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 04:07:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 04:07:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2022-11-03 04:07:42,504 INFO L87 Difference]: Start difference. First operand 7983 states and 32782 transitions. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:44,329 INFO L93 Difference]: Finished difference Result 18042 states and 72746 transitions. [2022-11-03 04:07:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-03 04:07:44,329 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:07:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:44,404 INFO L225 Difference]: With dead ends: 18042 [2022-11-03 04:07:44,404 INFO L226 Difference]: Without dead ends: 17998 [2022-11-03 04:07:44,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=586, Invalid=1576, Unknown=0, NotChecked=0, Total=2162 [2022-11-03 04:07:44,405 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1191 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:44,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 450 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 04:07:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17998 states. [2022-11-03 04:07:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17998 to 9031. [2022-11-03 04:07:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9031 states, 8952 states have (on average 4.165661304736372) internal successors, (37291), 9030 states have internal predecessors, (37291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 37291 transitions. [2022-11-03 04:07:44,701 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 37291 transitions. Word has length 16 [2022-11-03 04:07:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:44,701 INFO L495 AbstractCegarLoop]: Abstraction has 9031 states and 37291 transitions. [2022-11-03 04:07:44,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 37291 transitions. [2022-11-03 04:07:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:07:44,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:44,703 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:44,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:44,904 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 768476217, now seen corresponding path program 1 times [2022-11-03 04:07:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:44,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811953974] [2022-11-03 04:07:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:45,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811953974] [2022-11-03 04:07:45,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811953974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580073140] [2022-11-03 04:07:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:45,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:45,396 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:45,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 04:07:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:45,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:45,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:45,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:45,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:45,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:45,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:45,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:45,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:46,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2343 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) c_~X_0~0.base) (+ 8 c_~X_0~0.offset))))) is different from false [2022-11-03 04:07:46,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2342) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:07:46,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_120| Int)) (or (forall ((v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_120| v_ArrVal_2342) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_120|)))) is different from false [2022-11-03 04:07:46,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_120| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2341) |v_thread1Thread1of1ForFork2_~#t2~0.base_120| v_ArrVal_2342) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_120|)))) is different from false [2022-11-03 04:07:46,125 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:46,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:07:46,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:46,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1235 treesize of output 1189 [2022-11-03 04:07:46,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1174 treesize of output 1046 [2022-11-03 04:07:46,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 539 treesize of output 507 [2022-11-03 04:07:46,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1014 treesize of output 950 [2022-11-03 04:07:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:07:46,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580073140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:46,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [194716192] [2022-11-03 04:07:46,628 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:46,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:46,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:07:46,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646482919] [2022-11-03 04:07:46,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:46,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:07:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:46,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:07:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=670, Unknown=4, NotChecked=220, Total=992 [2022-11-03 04:07:46,630 INFO L87 Difference]: Start difference. First operand 9031 states and 37291 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:46,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483648)) (forall ((v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int)) (v_ArrVal_2341 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_120| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2341) |v_thread1Thread1of1ForFork2_~#t2~0.base_120| v_ArrVal_2342) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_120|)))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:07:48,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 c_~X_0~0.offset)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_120| Int)) (or (forall ((v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2342 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_120| v_ArrVal_2342) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2343) c_~X_0~0.base) .cse0) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_120|)))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 .cse0) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse1 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:07:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:50,103 INFO L93 Difference]: Finished difference Result 9735 states and 39510 transitions. [2022-11-03 04:07:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:07:50,104 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:07:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:50,149 INFO L225 Difference]: With dead ends: 9735 [2022-11-03 04:07:50,149 INFO L226 Difference]: Without dead ends: 9735 [2022-11-03 04:07:50,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=152, Invalid=988, Unknown=6, NotChecked=414, Total=1560 [2022-11-03 04:07:50,150 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 153 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:50,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 243 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1618 Invalid, 0 Unknown, 399 Unchecked, 1.1s Time] [2022-11-03 04:07:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-11-03 04:07:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9199. [2022-11-03 04:07:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9199 states, 9120 states have (on average 4.16546052631579) internal successors, (37989), 9198 states have internal predecessors, (37989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 37989 transitions. [2022-11-03 04:07:50,411 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 37989 transitions. Word has length 16 [2022-11-03 04:07:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:50,411 INFO L495 AbstractCegarLoop]: Abstraction has 9199 states and 37989 transitions. [2022-11-03 04:07:50,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 37989 transitions. [2022-11-03 04:07:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:07:50,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:50,413 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:50,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:50,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-03 04:07:50,614 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash 768476221, now seen corresponding path program 1 times [2022-11-03 04:07:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:50,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424561911] [2022-11-03 04:07:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:51,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424561911] [2022-11-03 04:07:51,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424561911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:51,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341171021] [2022-11-03 04:07:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:51,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:51,082 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:51,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-03 04:07:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:51,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:51,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:51,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:51,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:51,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:51,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:51,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:51,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:07:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:51,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:51,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-03 04:07:51,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-03 04:07:51,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_122| Int)) (or (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_122| v_ArrVal_2399) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_122|)))) is different from false [2022-11-03 04:07:51,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2400 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_122| Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2398) |v_thread1Thread1of1ForFork2_~#t2~0.base_122| v_ArrVal_2399) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_122|)))) is different from false [2022-11-03 04:07:51,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:51,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:07:51,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:51,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1105 treesize of output 1059 [2022-11-03 04:07:51,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 982 [2022-11-03 04:07:51,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 507 treesize of output 475 [2022-11-03 04:07:51,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 950 treesize of output 822 [2022-11-03 04:07:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:07:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341171021] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:53,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929179369] [2022-11-03 04:07:53,986 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:53,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:07:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120694012] [2022-11-03 04:07:53,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:53,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:07:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:07:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=670, Unknown=4, NotChecked=220, Total=992 [2022-11-03 04:07:53,989 INFO L87 Difference]: Start difference. First operand 9199 states and 37989 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:54,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_2400 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_122| Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2398) |v_thread1Thread1of1ForFork2_~#t2~0.base_122| v_ArrVal_2399) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_122|)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:07:56,192 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (+ 8 c_~X_0~0.offset))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select .cse0 .cse1) 2147483647) (<= (select .cse0 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_122| Int)) (or (forall ((v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_122| v_ArrVal_2399) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2400) c_~X_0~0.base) .cse1) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_122|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:07:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:57,170 INFO L93 Difference]: Finished difference Result 9691 states and 39352 transitions. [2022-11-03 04:07:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:07:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:07:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:57,206 INFO L225 Difference]: With dead ends: 9691 [2022-11-03 04:07:57,206 INFO L226 Difference]: Without dead ends: 9691 [2022-11-03 04:07:57,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=152, Invalid=988, Unknown=6, NotChecked=414, Total=1560 [2022-11-03 04:07:57,207 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 273 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:57,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 209 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1206 Invalid, 0 Unknown, 472 Unchecked, 0.8s Time] [2022-11-03 04:07:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2022-11-03 04:07:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 9193. [2022-11-03 04:07:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9193 states, 9114 states have (on average 4.162387535659425) internal successors, (37936), 9192 states have internal predecessors, (37936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9193 states to 9193 states and 37936 transitions. [2022-11-03 04:07:57,428 INFO L78 Accepts]: Start accepts. Automaton has 9193 states and 37936 transitions. Word has length 16 [2022-11-03 04:07:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:57,428 INFO L495 AbstractCegarLoop]: Abstraction has 9193 states and 37936 transitions. [2022-11-03 04:07:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9193 states and 37936 transitions. [2022-11-03 04:07:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:07:57,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:57,430 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:57,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:57,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-03 04:07:57,631 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:07:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1567605839, now seen corresponding path program 2 times [2022-11-03 04:07:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:57,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859185504] [2022-11-03 04:07:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:58,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:58,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859185504] [2022-11-03 04:07:58,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859185504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:58,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819632797] [2022-11-03 04:07:58,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:58,089 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:58,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-03 04:07:58,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:07:58,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:58,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:07:58,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:58,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,455 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:07:58,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:07:58,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:58,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:58,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:58,689 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:58,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:07:58,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:07:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:58,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:58,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2460) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:58,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2460) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2022-11-03 04:07:58,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2460 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2460) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:07:59,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:59,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:07:59,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:59,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:07:59,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 122 [2022-11-03 04:07:59,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 [2022-11-03 04:07:59,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-11-03 04:07:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:07:59,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819632797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:59,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1863070967] [2022-11-03 04:07:59,506 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:07:59,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:59,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:07:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966267892] [2022-11-03 04:07:59,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:59,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:07:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:07:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=727, Unknown=6, NotChecked=168, Total=992 [2022-11-03 04:07:59,510 INFO L87 Difference]: Start difference. First operand 9193 states and 37936 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:00,718 INFO L93 Difference]: Finished difference Result 10165 states and 41204 transitions. [2022-11-03 04:08:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:08:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:00,754 INFO L225 Difference]: With dead ends: 10165 [2022-11-03 04:08:00,754 INFO L226 Difference]: Without dead ends: 10165 [2022-11-03 04:08:00,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=1236, Unknown=6, NotChecked=222, Total=1640 [2022-11-03 04:08:00,754 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 269 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1104 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:00,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 237 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1023 Invalid, 0 Unknown, 1104 Unchecked, 0.7s Time] [2022-11-03 04:08:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10165 states. [2022-11-03 04:08:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10165 to 9289. [2022-11-03 04:08:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9289 states, 9210 states have (on average 4.168729641693811) internal successors, (38394), 9288 states have internal predecessors, (38394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9289 states to 9289 states and 38394 transitions. [2022-11-03 04:08:00,961 INFO L78 Accepts]: Start accepts. Automaton has 9289 states and 38394 transitions. Word has length 16 [2022-11-03 04:08:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:00,961 INFO L495 AbstractCegarLoop]: Abstraction has 9289 states and 38394 transitions. [2022-11-03 04:08:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9289 states and 38394 transitions. [2022-11-03 04:08:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:00,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:00,963 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:00,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-11-03 04:08:01,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:01,163 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1567605835, now seen corresponding path program 2 times [2022-11-03 04:08:01,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:01,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961547028] [2022-11-03 04:08:01,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:01,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961547028] [2022-11-03 04:08:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961547028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043423237] [2022-11-03 04:08:01,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:01,616 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:01,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-03 04:08:01,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:08:01,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:01,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:08:01,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:02,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:08:02,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:02,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:02,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:02,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:02,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:02,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:02,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:02,620 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2517 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2517) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 4294967296)) (not (< c_~i_7~0 c_~n_1~0))) is different from false [2022-11-03 04:08:19,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:19,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-03 04:08:19,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:19,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 313 [2022-11-03 04:08:19,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 296 treesize of output 268 [2022-11-03 04:08:19,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 268 treesize of output 212 [2022-11-03 04:08:19,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 112 treesize of output 98 [2022-11-03 04:08:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043423237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [135834581] [2022-11-03 04:08:19,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:19,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:19,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:08:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873192887] [2022-11-03 04:08:19,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:19,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:08:19,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:19,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:08:19,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=809, Unknown=25, NotChecked=58, Total=992 [2022-11-03 04:08:19,535 INFO L87 Difference]: Start difference. First operand 9289 states and 38394 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:22,464 INFO L93 Difference]: Finished difference Result 9317 states and 38475 transitions. [2022-11-03 04:08:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:08:22,464 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:22,501 INFO L225 Difference]: With dead ends: 9317 [2022-11-03 04:08:22,502 INFO L226 Difference]: Without dead ends: 9317 [2022-11-03 04:08:22,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=177, Invalid=1441, Unknown=26, NotChecked=78, Total=1722 [2022-11-03 04:08:22,503 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:22,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 279 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 269 Unchecked, 0.3s Time] [2022-11-03 04:08:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2022-11-03 04:08:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9296. [2022-11-03 04:08:22,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9296 states, 9217 states have (on average 4.168384506889444) internal successors, (38420), 9295 states have internal predecessors, (38420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9296 states to 9296 states and 38420 transitions. [2022-11-03 04:08:22,738 INFO L78 Accepts]: Start accepts. Automaton has 9296 states and 38420 transitions. Word has length 16 [2022-11-03 04:08:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:22,738 INFO L495 AbstractCegarLoop]: Abstraction has 9296 states and 38420 transitions. [2022-11-03 04:08:22,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9296 states and 38420 transitions. [2022-11-03 04:08:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:22,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:22,740 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:22,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:22,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-11-03 04:08:22,940 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1574509225, now seen corresponding path program 3 times [2022-11-03 04:08:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:22,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237212081] [2022-11-03 04:08:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:23,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:23,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237212081] [2022-11-03 04:08:23,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237212081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:23,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563768661] [2022-11-03 04:08:23,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:08:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:23,449 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:23,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-03 04:08:23,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:08:23,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:23,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:08:23,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:23,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:23,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:23,771 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:08:23,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:08:23,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:23,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:23,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:08:23,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:24,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:08:24,042 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:08:24,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:08:24,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:08:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:24,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:24,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2577 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2577) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 4294967296)) is different from false [2022-11-03 04:08:24,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2577 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2577) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-03 04:08:24,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:24,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:08:24,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:24,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 553 treesize of output 531 [2022-11-03 04:08:24,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 454 [2022-11-03 04:08:24,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 454 treesize of output 438 [2022-11-03 04:08:24,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 438 treesize of output 406 [2022-11-03 04:08:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:24,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563768661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:24,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [576240742] [2022-11-03 04:08:24,788 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:24,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:24,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:08:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353045286] [2022-11-03 04:08:24,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:24,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:08:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:08:24,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=788, Unknown=5, NotChecked=114, Total=992 [2022-11-03 04:08:24,790 INFO L87 Difference]: Start difference. First operand 9296 states and 38420 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:26,937 INFO L93 Difference]: Finished difference Result 10094 states and 40924 transitions. [2022-11-03 04:08:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:08:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:26,975 INFO L225 Difference]: With dead ends: 10094 [2022-11-03 04:08:26,975 INFO L226 Difference]: Without dead ends: 10094 [2022-11-03 04:08:26,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=1739, Unknown=5, NotChecked=174, Total=2162 [2022-11-03 04:08:26,975 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 355 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1098 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:26,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 243 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1282 Invalid, 0 Unknown, 1098 Unchecked, 1.0s Time] [2022-11-03 04:08:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10094 states. [2022-11-03 04:08:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10094 to 9281. [2022-11-03 04:08:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9281 states, 9202 states have (on average 4.186915887850467) internal successors, (38528), 9280 states have internal predecessors, (38528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 38528 transitions. [2022-11-03 04:08:27,190 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 38528 transitions. Word has length 16 [2022-11-03 04:08:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:27,190 INFO L495 AbstractCegarLoop]: Abstraction has 9281 states and 38528 transitions. [2022-11-03 04:08:27,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 38528 transitions. [2022-11-03 04:08:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:27,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:27,192 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:27,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:27,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-03 04:08:27,393 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1008479251, now seen corresponding path program 3 times [2022-11-03 04:08:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490132912] [2022-11-03 04:08:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:27,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:27,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490132912] [2022-11-03 04:08:27,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490132912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:27,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435933620] [2022-11-03 04:08:27,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:08:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:27,859 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:27,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-03 04:08:28,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:08:28,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:28,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:08:28,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:28,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:28,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:28,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:28,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:28,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:28,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2634) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2022-11-03 04:08:30,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (forall ((v_ArrVal_2634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) is different from false [2022-11-03 04:08:30,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) is different from false [2022-11-03 04:08:30,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) is different from false [2022-11-03 04:08:30,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2633 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2633) |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) is different from false [2022-11-03 04:08:30,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2633) |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) is different from false [2022-11-03 04:08:30,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:30,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:08:30,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:30,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-03 04:08:30,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 582 treesize of output 566 [2022-11-03 04:08:30,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 566 treesize of output 502 [2022-11-03 04:08:30,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 502 treesize of output 470 [2022-11-03 04:08:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:08:31,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435933620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:31,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826211759] [2022-11-03 04:08:31,894 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:31,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:31,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:08:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933870688] [2022-11-03 04:08:31,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:08:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:08:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=589, Unknown=6, NotChecked=318, Total=992 [2022-11-03 04:08:31,895 INFO L87 Difference]: Start difference. First operand 9281 states and 38528 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:32,449 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_2634 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) .cse1) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:08:32,483 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 c_~X_0~0.offset)) (.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 .cse1) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((v_ArrVal_2634 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) .cse1) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:08:32,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (= c_~i_7~0 0) (<= 0 (+ (select .cse0 (+ 8 c_~X_0~0.offset)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((v_ArrVal_2634 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:08:34,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base)) (.cse1 (* 4 c_~i_7~0))) (and (= c_~i_7~0 1) (<= 0 (+ (select .cse0 (+ 4 .cse1)) 2147483648)) (<= 0 (+ (select .cse0 (+ 8 c_~X_0~0.offset)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_130| Int)) (or (forall ((v_ArrVal_2634 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_130| v_ArrVal_2634) c_~X_0~0.base) (+ c_~X_0~0.offset 4 .cse1)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_130|)))) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:08:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:35,186 INFO L93 Difference]: Finished difference Result 9983 states and 40844 transitions. [2022-11-03 04:08:35,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:08:35,187 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:35,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:35,227 INFO L225 Difference]: With dead ends: 9983 [2022-11-03 04:08:35,227 INFO L226 Difference]: Without dead ends: 9983 [2022-11-03 04:08:35,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=122, Invalid=900, Unknown=10, NotChecked=690, Total=1722 [2022-11-03 04:08:35,228 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 173 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 715 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:35,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 156 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1079 Invalid, 0 Unknown, 715 Unchecked, 0.8s Time] [2022-11-03 04:08:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2022-11-03 04:08:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 9437. [2022-11-03 04:08:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9437 states, 9358 states have (on average 4.192776234238085) internal successors, (39236), 9436 states have internal predecessors, (39236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9437 states to 9437 states and 39236 transitions. [2022-11-03 04:08:35,455 INFO L78 Accepts]: Start accepts. Automaton has 9437 states and 39236 transitions. Word has length 16 [2022-11-03 04:08:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:35,456 INFO L495 AbstractCegarLoop]: Abstraction has 9437 states and 39236 transitions. [2022-11-03 04:08:35,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 9437 states and 39236 transitions. [2022-11-03 04:08:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:35,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:35,457 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:35,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-11-03 04:08:35,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:35,658 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:35,658 INFO L85 PathProgramCache]: Analyzing trace with hash -960217831, now seen corresponding path program 4 times [2022-11-03 04:08:35,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:35,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520921200] [2022-11-03 04:08:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:36,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520921200] [2022-11-03 04:08:36,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520921200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901507338] [2022-11-03 04:08:36,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:08:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:36,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:36,239 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:36,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-03 04:08:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:36,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:08:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:36,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:36,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:36,639 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:08:36,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:08:36,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:36,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:36,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:36,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:36,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:36,953 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:08:36,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:08:37,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:37,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:37,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2694) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2022-11-03 04:08:37,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2694) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_7~0))) 9223372039002259456))) is different from false [2022-11-03 04:08:37,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:37,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:08:37,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:37,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:08:37,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 143 treesize of output 135 [2022-11-03 04:08:37,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 262 [2022-11-03 04:08:37,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 262 treesize of output 230 [2022-11-03 04:08:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:08:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901507338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:38,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [614539745] [2022-11-03 04:08:38,331 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:38,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:38,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:08:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963948796] [2022-11-03 04:08:38,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:38,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:08:38,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:08:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=775, Unknown=9, NotChecked=114, Total=992 [2022-11-03 04:08:38,333 INFO L87 Difference]: Start difference. First operand 9437 states and 39236 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:39,852 INFO L93 Difference]: Finished difference Result 10923 states and 44527 transitions. [2022-11-03 04:08:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:08:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:39,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:39,895 INFO L225 Difference]: With dead ends: 10923 [2022-11-03 04:08:39,895 INFO L226 Difference]: Without dead ends: 10923 [2022-11-03 04:08:39,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=1482, Unknown=9, NotChecked=162, Total=1892 [2022-11-03 04:08:39,896 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 303 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:39,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 209 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 821 Invalid, 0 Unknown, 811 Unchecked, 0.6s Time] [2022-11-03 04:08:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10923 states. [2022-11-03 04:08:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10923 to 9497. [2022-11-03 04:08:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9497 states, 9418 states have (on average 4.192609895943937) internal successors, (39486), 9496 states have internal predecessors, (39486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9497 states to 9497 states and 39486 transitions. [2022-11-03 04:08:40,123 INFO L78 Accepts]: Start accepts. Automaton has 9497 states and 39486 transitions. Word has length 16 [2022-11-03 04:08:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:40,124 INFO L495 AbstractCegarLoop]: Abstraction has 9497 states and 39486 transitions. [2022-11-03 04:08:40,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9497 states and 39486 transitions. [2022-11-03 04:08:40,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:40,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:40,125 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:40,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:40,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:40,326 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2104542831, now seen corresponding path program 2 times [2022-11-03 04:08:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941633345] [2022-11-03 04:08:40,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:40,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:40,793 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-03 04:08:40,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941633345] [2022-11-03 04:08:40,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941633345] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:40,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59705491] [2022-11-03 04:08:40,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:40,796 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:40,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-03 04:08:41,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:08:41,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:41,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:08:41,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:41,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:41,277 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:08:41,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:08:41,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:41,391 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:08:41,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:08:41,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:41,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:41,486 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:08:41,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:08:41,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:41,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:41,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:08:41,634 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-03 04:08:41,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:41,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2757 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2757) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:08:41,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2757 (Array Int Int)) (v_ArrVal_2756 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2756) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_2757) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:08:41,921 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 04:08:41,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-11-03 04:08:41,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:41,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-03 04:08:41,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 582 treesize of output 550 [2022-11-03 04:08:41,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 275 treesize of output 259 [2022-11-03 04:08:41,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 534 treesize of output 470 [2022-11-03 04:08:42,434 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-03 04:08:42,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59705491] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:42,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1092932109] [2022-11-03 04:08:42,434 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:42,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:42,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 04:08:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288108115] [2022-11-03 04:08:42,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:42,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:08:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:08:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=567, Unknown=5, NotChecked=98, Total=756 [2022-11-03 04:08:42,439 INFO L87 Difference]: Start difference. First operand 9497 states and 39486 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:43,214 INFO L93 Difference]: Finished difference Result 12362 states and 50415 transitions. [2022-11-03 04:08:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:08:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:43,262 INFO L225 Difference]: With dead ends: 12362 [2022-11-03 04:08:43,262 INFO L226 Difference]: Without dead ends: 12342 [2022-11-03 04:08:43,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=902, Unknown=6, NotChecked=126, Total=1190 [2022-11-03 04:08:43,263 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 142 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:43,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 108 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 414 Invalid, 0 Unknown, 541 Unchecked, 0.3s Time] [2022-11-03 04:08:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12342 states. [2022-11-03 04:08:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12342 to 9603. [2022-11-03 04:08:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9603 states, 9524 states have (on average 4.190571188576229) internal successors, (39911), 9602 states have internal predecessors, (39911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9603 states to 9603 states and 39911 transitions. [2022-11-03 04:08:43,499 INFO L78 Accepts]: Start accepts. Automaton has 9603 states and 39911 transitions. Word has length 16 [2022-11-03 04:08:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:43,499 INFO L495 AbstractCegarLoop]: Abstraction has 9603 states and 39911 transitions. [2022-11-03 04:08:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9603 states and 39911 transitions. [2022-11-03 04:08:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 04:08:43,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:43,501 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:43,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-11-03 04:08:43,702 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:43,703 INFO L85 PathProgramCache]: Analyzing trace with hash -577174520, now seen corresponding path program 3 times [2022-11-03 04:08:43,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:43,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264666100] [2022-11-03 04:08:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:43,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:43,882 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-03 04:08:43,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:43,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264666100] [2022-11-03 04:08:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264666100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:43,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532125417] [2022-11-03 04:08:43,883 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:08:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:43,885 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:43,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-03 04:08:44,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:08:44,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:44,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 04:08:44,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:44,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532125417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [71343177] [2022-11-03 04:08:44,442 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:44,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:44,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-11-03 04:08:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523945642] [2022-11-03 04:08:44,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:08:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:08:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-11-03 04:08:44,444 INFO L87 Difference]: Start difference. First operand 9603 states and 39911 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:45,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:45,391 INFO L93 Difference]: Finished difference Result 12559 states and 50447 transitions. [2022-11-03 04:08:45,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:08:45,392 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 04:08:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:45,442 INFO L225 Difference]: With dead ends: 12559 [2022-11-03 04:08:45,442 INFO L226 Difference]: Without dead ends: 12503 [2022-11-03 04:08:45,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 04:08:45,443 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 764 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:45,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 245 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 04:08:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2022-11-03 04:08:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 10238. [2022-11-03 04:08:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10238 states, 10159 states have (on average 4.234275027069593) internal successors, (43016), 10237 states have internal predecessors, (43016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 43016 transitions. [2022-11-03 04:08:45,705 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 43016 transitions. Word has length 16 [2022-11-03 04:08:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:45,705 INFO L495 AbstractCegarLoop]: Abstraction has 10238 states and 43016 transitions. [2022-11-03 04:08:45,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 43016 transitions. [2022-11-03 04:08:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:08:45,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:45,708 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:45,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:45,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-11-03 04:08:45,909 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2126648043, now seen corresponding path program 5 times [2022-11-03 04:08:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:45,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816550018] [2022-11-03 04:08:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:46,392 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-03 04:08:46,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:46,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816550018] [2022-11-03 04:08:46,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816550018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:46,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827120196] [2022-11-03 04:08:46,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:46,394 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:46,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-03 04:08:46,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:08:46,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:46,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:08:46,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:47,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:47,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:47,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:47,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:47,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:47,265 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-03 04:08:47,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:47,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2855 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2855) c_~X_0~0.base) (+ 16 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:08:47,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2855 (Array Int Int)) (v_ArrVal_2854 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2854) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2855) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 04:08:47,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:47,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:08:47,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:47,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 04:08:47,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 59 [2022-11-03 04:08:47,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 110 [2022-11-03 04:08:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 04:08:47,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827120196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:47,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1258695680] [2022-11-03 04:08:47,740 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:47,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:47,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 04:08:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307586011] [2022-11-03 04:08:47,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:08:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:08:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1155, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 04:08:47,742 INFO L87 Difference]: Start difference. First operand 10238 states and 43016 transitions. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:50,048 INFO L93 Difference]: Finished difference Result 11660 states and 47312 transitions. [2022-11-03 04:08:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:08:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:08:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:50,093 INFO L225 Difference]: With dead ends: 11660 [2022-11-03 04:08:50,093 INFO L226 Difference]: Without dead ends: 11660 [2022-11-03 04:08:50,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1962, Unknown=2, NotChecked=182, Total=2352 [2022-11-03 04:08:50,094 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 416 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:50,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 484 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2715 Invalid, 0 Unknown, 339 Unchecked, 1.6s Time] [2022-11-03 04:08:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2022-11-03 04:08:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 10244. [2022-11-03 04:08:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10165 states have (on average 4.234431874077718) internal successors, (43043), 10243 states have internal predecessors, (43043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 43043 transitions. [2022-11-03 04:08:50,337 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 43043 transitions. Word has length 17 [2022-11-03 04:08:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:50,338 INFO L495 AbstractCegarLoop]: Abstraction has 10244 states and 43043 transitions. [2022-11-03 04:08:50,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 43043 transitions. [2022-11-03 04:08:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:08:50,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:50,339 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:50,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:50,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:50,540 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread4Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2126648047, now seen corresponding path program 4 times [2022-11-03 04:08:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:50,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63016647] [2022-11-03 04:08:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:51,067 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-03 04:08:51,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63016647] [2022-11-03 04:08:51,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63016647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:51,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922905237] [2022-11-03 04:08:51,068 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:08:51,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:51,070 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:51,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-03 04:08:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:51,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:08:51,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:51,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:51,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:08:51,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:51,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:08:51,837 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-03 04:08:51,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:51,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2905 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2905) c_~X_0~0.base) (+ 16 c_~X_0~0.offset)) 4294967296)) is different from false [2022-11-03 04:08:51,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2905 (Array Int Int)) (v_ArrVal_2904 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2904) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2905) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 04:08:52,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:52,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:08:52,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:52,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-11-03 04:08:52,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:08:52,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:08:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 04:08:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922905237] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1323324280] [2022-11-03 04:08:52,256 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:52,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:52,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-11-03 04:08:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677398603] [2022-11-03 04:08:52,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:52,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:08:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:08:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1155, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 04:08:52,259 INFO L87 Difference]: Start difference. First operand 10244 states and 43043 transitions. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:55,002 INFO L93 Difference]: Finished difference Result 11660 states and 47306 transitions. [2022-11-03 04:08:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:08:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:08:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:55,049 INFO L225 Difference]: With dead ends: 11660 [2022-11-03 04:08:55,049 INFO L226 Difference]: Without dead ends: 11660 [2022-11-03 04:08:55,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=1962, Unknown=2, NotChecked=182, Total=2352 [2022-11-03 04:08:55,049 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 388 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 3770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:55,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 542 Invalid, 3770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3408 Invalid, 0 Unknown, 337 Unchecked, 2.0s Time] [2022-11-03 04:08:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2022-11-03 04:08:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 10244. [2022-11-03 04:08:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10165 states have (on average 4.2338416133792425) internal successors, (43037), 10243 states have internal predecessors, (43037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 43037 transitions. [2022-11-03 04:08:55,310 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 43037 transitions. Word has length 17 [2022-11-03 04:08:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:55,310 INFO L495 AbstractCegarLoop]: Abstraction has 10244 states and 43037 transitions. [2022-11-03 04:08:55,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 43037 transitions. [2022-11-03 04:08:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:08:55,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:55,313 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:55,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:55,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:55,513 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread4Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:08:55,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash 981176417, now seen corresponding path program 5 times [2022-11-03 04:08:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:55,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250817995] [2022-11-03 04:08:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:56,031 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-03 04:08:56,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:56,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250817995] [2022-11-03 04:08:56,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250817995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:56,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802826871] [2022-11-03 04:08:56,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:56,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:56,034 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:56,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-11-03 04:08:56,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:08:56,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:56,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 04:08:56,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:56,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:56,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:56,522 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:08:56,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:08:56,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:08:56,678 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 04:08:56,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:08:56,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:56,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:56,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:08:56,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:08:56,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:56,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:08:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:56,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:57,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2971 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2971) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:08:57,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2971 (Array Int Int)) (v_ArrVal_2970 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_2970) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2971) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-11-03 04:08:57,314 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 04:08:57,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 54 [2022-11-03 04:08:57,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:57,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 640 treesize of output 632 [2022-11-03 04:08:57,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 582 treesize of output 518 [2022-11-03 04:08:57,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 486 [2022-11-03 04:08:57,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 251 treesize of output 235 [2022-11-03 04:08:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:57,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802826871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620310236] [2022-11-03 04:08:57,868 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:08:57,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:57,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 32 [2022-11-03 04:08:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133935059] [2022-11-03 04:08:57,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 04:08:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:57,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 04:08:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=880, Unknown=6, NotChecked=122, Total=1122 [2022-11-03 04:08:57,870 INFO L87 Difference]: Start difference. First operand 10244 states and 43037 transitions. Second operand has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:59,774 INFO L93 Difference]: Finished difference Result 12276 states and 49835 transitions. [2022-11-03 04:08:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 04:08:59,775 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:08:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:59,819 INFO L225 Difference]: With dead ends: 12276 [2022-11-03 04:08:59,819 INFO L226 Difference]: Without dead ends: 12276 [2022-11-03 04:08:59,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=268, Invalid=1896, Unknown=6, NotChecked=182, Total=2352 [2022-11-03 04:08:59,820 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 317 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1077 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:59,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 243 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1249 Invalid, 0 Unknown, 1077 Unchecked, 0.9s Time] [2022-11-03 04:08:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12276 states. [2022-11-03 04:09:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12276 to 10310. [2022-11-03 04:09:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10310 states, 10231 states have (on average 4.216010165184244) internal successors, (43134), 10309 states have internal predecessors, (43134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10310 states to 10310 states and 43134 transitions. [2022-11-03 04:09:00,067 INFO L78 Accepts]: Start accepts. Automaton has 10310 states and 43134 transitions. Word has length 17 [2022-11-03 04:09:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:00,067 INFO L495 AbstractCegarLoop]: Abstraction has 10310 states and 43134 transitions. [2022-11-03 04:09:00,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 10310 states and 43134 transitions. [2022-11-03 04:09:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:00,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:00,069 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:00,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:00,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-11-03 04:09:00,270 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1891842631, now seen corresponding path program 3 times [2022-11-03 04:09:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:00,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186746249] [2022-11-03 04:09:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:00,889 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-03 04:09:00,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186746249] [2022-11-03 04:09:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186746249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759013332] [2022-11-03 04:09:00,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:00,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:00,891 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:00,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-11-03 04:09:01,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:01,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:01,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:09:01,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:01,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:01,365 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:09:01,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:09:01,408 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:09:01,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-11-03 04:09:01,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:01,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:01,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:01,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:01,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:01,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:01,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3036 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3036) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:01,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3035) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3036) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:01,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-11-03 04:09:01,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3034) |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)))) is different from false [2022-11-03 04:09:01,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3034 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3033 Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int)) (or (< 0 (+ (select (select (store (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~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_3033)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3034) |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)))) is different from false [2022-11-03 04:09:01,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_319| Int) (v_ArrVal_3034 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3033 Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int) (v_ArrVal_3031 Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_319|)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (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~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_3031) (+ (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_319|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_3033)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3034) |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)))) is different from false [2022-11-03 04:09:01,809 INFO L356 Elim1Store]: treesize reduction 94, result has 28.2 percent of original size [2022-11-03 04:09:01,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2022-11-03 04:09:01,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:01,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:09:01,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 130 [2022-11-03 04:09:01,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 [2022-11-03 04:09:01,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 54 [2022-11-03 04:09:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 04:09:02,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759013332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:02,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591495532] [2022-11-03 04:09:02,042 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:02,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:02,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653605929] [2022-11-03 04:09:02,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:02,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:02,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=532, Unknown=6, NotChecked=306, Total=930 [2022-11-03 04:09:02,044 INFO L87 Difference]: Start difference. First operand 10310 states and 43134 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:02,458 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_5~0 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ (div (- |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 2) |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:09:02,469 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_150| Int) (v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_142| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_150|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_142|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_142| v_ArrVal_3035) |v_thread1Thread1of1ForFork2_~#t3~0.base_150| v_ArrVal_3036) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:09:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:03,473 INFO L93 Difference]: Finished difference Result 15772 states and 64611 transitions. [2022-11-03 04:09:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:09:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:03,537 INFO L225 Difference]: With dead ends: 15772 [2022-11-03 04:09:03,537 INFO L226 Difference]: Without dead ends: 15752 [2022-11-03 04:09:03,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1072, Unknown=8, NotChecked=600, Total=1892 [2022-11-03 04:09:03,538 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 288 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 815 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:03,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 142 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 804 Invalid, 0 Unknown, 815 Unchecked, 0.6s Time] [2022-11-03 04:09:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15752 states. [2022-11-03 04:09:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15752 to 11060. [2022-11-03 04:09:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11060 states, 10981 states have (on average 4.211638284309261) internal successors, (46248), 11059 states have internal predecessors, (46248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11060 states to 11060 states and 46248 transitions. [2022-11-03 04:09:03,858 INFO L78 Accepts]: Start accepts. Automaton has 11060 states and 46248 transitions. Word has length 17 [2022-11-03 04:09:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:03,858 INFO L495 AbstractCegarLoop]: Abstraction has 11060 states and 46248 transitions. [2022-11-03 04:09:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11060 states and 46248 transitions. [2022-11-03 04:09:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:03,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:03,860 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:03,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:04,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-11-03 04:09:04,061 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -364474320, now seen corresponding path program 4 times [2022-11-03 04:09:04,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:04,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427797856] [2022-11-03 04:09:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:04,767 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-03 04:09:04,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:04,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427797856] [2022-11-03 04:09:04,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427797856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:04,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792825161] [2022-11-03 04:09:04,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:04,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:04,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:04,769 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:04,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-11-03 04:09:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:05,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 04:09:05,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:05,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:05,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:05,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:05,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:05,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:09:05,469 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-03 04:09:05,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:05,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3092 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3092) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:05,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_144| Int) (v_ArrVal_3092 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_144| v_ArrVal_3092) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_144|)))) is different from false [2022-11-03 04:09:05,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_144| Int) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3092 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_144|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3091) |v_thread1Thread1of1ForFork2_~#t2~0.base_144| v_ArrVal_3092) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-03 04:09:05,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:05,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 04:09:05,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:05,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 04:09:05,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:05,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:05,947 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-03 04:09:05,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792825161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:05,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193204566] [2022-11-03 04:09:05,948 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:05,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:05,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-11-03 04:09:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222423792] [2022-11-03 04:09:05,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 04:09:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 04:09:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=852, Unknown=3, NotChecked=180, Total=1122 [2022-11-03 04:09:05,951 INFO L87 Difference]: Start difference. First operand 11060 states and 46248 transitions. Second operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:06,193 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= c_~t_4~0 2147483647) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_144| Int) (v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3092 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_144|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3091) |v_thread1Thread1of1ForFork2_~#t2~0.base_144| v_ArrVal_3092) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:09:06,214 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 12) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_144| Int) (v_ArrVal_3092 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_144| v_ArrVal_3092) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_144|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:09:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:08,149 INFO L93 Difference]: Finished difference Result 16831 states and 68361 transitions. [2022-11-03 04:09:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:09:08,149 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:08,217 INFO L225 Difference]: With dead ends: 16831 [2022-11-03 04:09:08,217 INFO L226 Difference]: Without dead ends: 16831 [2022-11-03 04:09:08,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=1729, Unknown=5, NotChecked=440, Total=2352 [2022-11-03 04:09:08,218 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 664 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 647 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:08,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 443 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2132 Invalid, 0 Unknown, 647 Unchecked, 1.5s Time] [2022-11-03 04:09:08,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16831 states. [2022-11-03 04:09:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16831 to 11367. [2022-11-03 04:09:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11288 states have (on average 4.235648476257973) internal successors, (47812), 11366 states have internal predecessors, (47812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 47812 transitions. [2022-11-03 04:09:08,544 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 47812 transitions. Word has length 17 [2022-11-03 04:09:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:08,544 INFO L495 AbstractCegarLoop]: Abstraction has 11367 states and 47812 transitions. [2022-11-03 04:09:08,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 47812 transitions. [2022-11-03 04:09:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:08,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:08,546 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:08,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:08,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:08,747 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash -364474323, now seen corresponding path program 3 times [2022-11-03 04:09:08,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878318278] [2022-11-03 04:09:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:09,355 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-03 04:09:09,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:09,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878318278] [2022-11-03 04:09:09,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878318278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:09,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215840646] [2022-11-03 04:09:09,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:09,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:09,359 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:09,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-11-03 04:09:09,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:09,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:09,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:09:09,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:09,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:09,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:09,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:09,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:09,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:09,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:09,997 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-03 04:09:09,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:10,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3148 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3148) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:10,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3148 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_146| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_146|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_146| v_ArrVal_3148) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456)))) is different from false [2022-11-03 04:09:10,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_146| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_146|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3147) |v_thread1Thread1of1ForFork2_~#t2~0.base_146| v_ArrVal_3148) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-11-03 04:09:10,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:10,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 04:09:10,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:10,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-03 04:09:10,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:10,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:09:10,403 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-03 04:09:10,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215840646] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:10,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409260016] [2022-11-03 04:09:10,404 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:10,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:10,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-11-03 04:09:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699533869] [2022-11-03 04:09:10,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:10,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 04:09:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:10,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 04:09:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=852, Unknown=3, NotChecked=180, Total=1122 [2022-11-03 04:09:10,407 INFO L87 Difference]: Start difference. First operand 11367 states and 47812 transitions. Second operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:10,662 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_ArrVal_3147 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_146| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_146|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3147) |v_thread1Thread1of1ForFork2_~#t2~0.base_146| v_ArrVal_3148) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:09:10,684 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_3148 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_146| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_146|)) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_146| v_ArrVal_3148) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 12) 2147483648)) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:09:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:12,459 INFO L93 Difference]: Finished difference Result 16831 states and 68081 transitions. [2022-11-03 04:09:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:09:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:12,567 INFO L225 Difference]: With dead ends: 16831 [2022-11-03 04:09:12,567 INFO L226 Difference]: Without dead ends: 16823 [2022-11-03 04:09:12,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=178, Invalid=1729, Unknown=5, NotChecked=440, Total=2352 [2022-11-03 04:09:12,568 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 524 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:12,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 449 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2135 Invalid, 0 Unknown, 581 Unchecked, 1.3s Time] [2022-11-03 04:09:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16823 states. [2022-11-03 04:09:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16823 to 11078. [2022-11-03 04:09:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11078 states, 10999 states have (on average 4.2104736794254025) internal successors, (46311), 11077 states have internal predecessors, (46311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11078 states to 11078 states and 46311 transitions. [2022-11-03 04:09:12,923 INFO L78 Accepts]: Start accepts. Automaton has 11078 states and 46311 transitions. Word has length 17 [2022-11-03 04:09:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:12,923 INFO L495 AbstractCegarLoop]: Abstraction has 11078 states and 46311 transitions. [2022-11-03 04:09:12,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 33 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 11078 states and 46311 transitions. [2022-11-03 04:09:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:12,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:12,925 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:12,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:13,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-11-03 04:09:13,126 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash -901240409, now seen corresponding path program 1 times [2022-11-03 04:09:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:13,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786659098] [2022-11-03 04:09:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:13,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786659098] [2022-11-03 04:09:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786659098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486732902] [2022-11-03 04:09:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:13,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:13,758 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:13,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-11-03 04:09:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:14,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:14,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:14,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,104 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:14,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:09:14,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:14,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:14,298 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:14,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:14,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:14,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:14,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:14,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:09:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:14,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:14,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3208) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:14,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3208 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3208) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:14,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 (Array Int Int)) (v_ArrVal_3208 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3208) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:14,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:14,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:09:14,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:14,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1105 treesize of output 1059 [2022-11-03 04:09:14,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 918 [2022-11-03 04:09:14,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 918 treesize of output 886 [2022-11-03 04:09:14,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 886 treesize of output 822 [2022-11-03 04:09:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:09:17,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486732902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1686236131] [2022-11-03 04:09:17,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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:17,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:17,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64404411] [2022-11-03 04:09:17,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=691, Unknown=4, NotChecked=162, Total=930 [2022-11-03 04:09:17,207 INFO L87 Difference]: Start difference. First operand 11078 states and 46311 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:19,651 INFO L93 Difference]: Finished difference Result 19509 states and 79417 transitions. [2022-11-03 04:09:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 04:09:19,651 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:19,736 INFO L225 Difference]: With dead ends: 19509 [2022-11-03 04:09:19,736 INFO L226 Difference]: Without dead ends: 19509 [2022-11-03 04:09:19,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=1936, Unknown=4, NotChecked=276, Total=2450 [2022-11-03 04:09:19,737 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 520 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1318 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:19,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 338 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1912 Invalid, 0 Unknown, 1318 Unchecked, 1.3s Time] [2022-11-03 04:09:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19509 states. [2022-11-03 04:09:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19509 to 12429. [2022-11-03 04:09:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12429 states, 12350 states have (on average 4.257813765182187) internal successors, (52584), 12428 states have internal predecessors, (52584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12429 states to 12429 states and 52584 transitions. [2022-11-03 04:09:20,111 INFO L78 Accepts]: Start accepts. Automaton has 12429 states and 52584 transitions. Word has length 17 [2022-11-03 04:09:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:20,111 INFO L495 AbstractCegarLoop]: Abstraction has 12429 states and 52584 transitions. [2022-11-03 04:09:20,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 12429 states and 52584 transitions. [2022-11-03 04:09:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:20,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:20,114 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:20,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:20,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:20,314 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash -901240412, now seen corresponding path program 1 times [2022-11-03 04:09:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:20,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606635678] [2022-11-03 04:09:20,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:20,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:20,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:20,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606635678] [2022-11-03 04:09:20,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606635678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:20,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578685172] [2022-11-03 04:09:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:20,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:20,799 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:20,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-11-03 04:09:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:21,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:21,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:21,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:21,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:21,150 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:21,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:09:21,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:21,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:21,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:21,382 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:21,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:21,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:21,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:21,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:21,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:21,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:21,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3268 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3268) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:21,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3268 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3268) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:21,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3267 (Array Int Int)) (v_ArrVal_3268 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3267) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3268) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:21,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:21,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:09:21,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:21,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:09:21,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 254 [2022-11-03 04:09:21,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 238 [2022-11-03 04:09:21,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:09:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:09:22,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578685172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:22,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906138735] [2022-11-03 04:09:22,211 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:22,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:22,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023769383] [2022-11-03 04:09:22,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:22,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:22,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:22,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:22,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=691, Unknown=4, NotChecked=162, Total=930 [2022-11-03 04:09:22,212 INFO L87 Difference]: Start difference. First operand 12429 states and 52584 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:24,323 INFO L93 Difference]: Finished difference Result 20841 states and 84821 transitions. [2022-11-03 04:09:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:09:24,324 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:24,403 INFO L225 Difference]: With dead ends: 20841 [2022-11-03 04:09:24,403 INFO L226 Difference]: Without dead ends: 20809 [2022-11-03 04:09:24,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=197, Invalid=1451, Unknown=4, NotChecked=240, Total=1892 [2022-11-03 04:09:24,404 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 375 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1382 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:24,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 300 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1637 Invalid, 0 Unknown, 1382 Unchecked, 1.1s Time] [2022-11-03 04:09:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20809 states. [2022-11-03 04:09:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20809 to 13011. [2022-11-03 04:09:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13011 states, 12932 states have (on average 4.239870089699969) internal successors, (54830), 13010 states have internal predecessors, (54830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13011 states to 13011 states and 54830 transitions. [2022-11-03 04:09:24,769 INFO L78 Accepts]: Start accepts. Automaton has 13011 states and 54830 transitions. Word has length 17 [2022-11-03 04:09:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:24,769 INFO L495 AbstractCegarLoop]: Abstraction has 13011 states and 54830 transitions. [2022-11-03 04:09:24,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13011 states and 54830 transitions. [2022-11-03 04:09:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:24,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:24,772 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:24,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:24,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:24,973 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1214334209, now seen corresponding path program 2 times [2022-11-03 04:09:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:24,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411318337] [2022-11-03 04:09:24,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:25,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411318337] [2022-11-03 04:09:25,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411318337] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286104868] [2022-11-03 04:09:25,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:25,429 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:25,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-11-03 04:09:25,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:09:25,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:25,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:25,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:26,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:09:26,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:26,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:26,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:26,479 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-03 04:09:26,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-11-03 04:09:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:26,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:26,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:26,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-03 04:09:26,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:26,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 313 [2022-11-03 04:09:26,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 148 treesize of output 120 [2022-11-03 04:09:26,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 268 treesize of output 212 [2022-11-03 04:09:27,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 212 treesize of output 198 [2022-11-03 04:09:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:27,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286104868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:27,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1889876682] [2022-11-03 04:09:27,742 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:27,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:27,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317657702] [2022-11-03 04:09:27,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:27,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=817, Unknown=16, NotChecked=0, Total=930 [2022-11-03 04:09:27,748 INFO L87 Difference]: Start difference. First operand 13011 states and 54830 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:28,648 INFO L93 Difference]: Finished difference Result 13053 states and 54953 transitions. [2022-11-03 04:09:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:09:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:28,705 INFO L225 Difference]: With dead ends: 13053 [2022-11-03 04:09:28,705 INFO L226 Difference]: Without dead ends: 13053 [2022-11-03 04:09:28,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=1440, Unknown=17, NotChecked=0, Total=1640 [2022-11-03 04:09:28,705 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:28,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 256 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2022-11-03 04:09:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13053 states. [2022-11-03 04:09:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 13015. [2022-11-03 04:09:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13015 states, 12936 states have (on average 4.2397186147186146) internal successors, (54845), 13014 states have internal predecessors, (54845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13015 states to 13015 states and 54845 transitions. [2022-11-03 04:09:29,222 INFO L78 Accepts]: Start accepts. Automaton has 13015 states and 54845 transitions. Word has length 17 [2022-11-03 04:09:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:29,222 INFO L495 AbstractCegarLoop]: Abstraction has 13015 states and 54845 transitions. [2022-11-03 04:09:29,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13015 states and 54845 transitions. [2022-11-03 04:09:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:29,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:29,224 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:29,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:29,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:29,425 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:29,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1214334212, now seen corresponding path program 2 times [2022-11-03 04:09:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:29,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404863225] [2022-11-03 04:09:29,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:29,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:29,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404863225] [2022-11-03 04:09:29,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404863225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:29,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748671446] [2022-11-03 04:09:29,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:09:29,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:29,931 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:29,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-11-03 04:09:30,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:09:30,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:30,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:30,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:30,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:09:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:30,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:09:30,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:30,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:09:30,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:30,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:09:30,942 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-03 04:09:30,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-03 04:09:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:30,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:31,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:31,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:09:31,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:31,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 178 [2022-11-03 04:09:31,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 159 treesize of output 131 [2022-11-03 04:09:31,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 61 [2022-11-03 04:09:31,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124 treesize of output 110 [2022-11-03 04:09:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:32,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748671446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [951065772] [2022-11-03 04:09:32,051 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:32,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:32,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066523334] [2022-11-03 04:09:32,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:32,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:32,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=822, Unknown=11, NotChecked=0, Total=930 [2022-11-03 04:09:32,053 INFO L87 Difference]: Start difference. First operand 13015 states and 54845 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:33,274 INFO L93 Difference]: Finished difference Result 15194 states and 61657 transitions. [2022-11-03 04:09:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 04:09:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:33,330 INFO L225 Difference]: With dead ends: 15194 [2022-11-03 04:09:33,330 INFO L226 Difference]: Without dead ends: 15194 [2022-11-03 04:09:33,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=189, Invalid=1521, Unknown=12, NotChecked=0, Total=1722 [2022-11-03 04:09:33,330 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 123 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:33,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 261 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 791 Invalid, 0 Unknown, 423 Unchecked, 0.6s Time] [2022-11-03 04:09:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15194 states. [2022-11-03 04:09:33,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15194 to 13055. [2022-11-03 04:09:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13055 states, 12976 states have (on average 4.239364981504315) internal successors, (55010), 13054 states have internal predecessors, (55010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13055 states to 13055 states and 55010 transitions. [2022-11-03 04:09:33,635 INFO L78 Accepts]: Start accepts. Automaton has 13055 states and 55010 transitions. Word has length 17 [2022-11-03 04:09:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:33,635 INFO L495 AbstractCegarLoop]: Abstraction has 13055 states and 55010 transitions. [2022-11-03 04:09:33,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13055 states and 55010 transitions. [2022-11-03 04:09:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:33,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:33,638 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:33,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:33,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-11-03 04:09:33,839 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1934085943, now seen corresponding path program 3 times [2022-11-03 04:09:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:33,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049497053] [2022-11-03 04:09:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:34,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049497053] [2022-11-03 04:09:34,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049497053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618023411] [2022-11-03 04:09:34,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:34,258 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:34,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-11-03 04:09:34,582 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:34,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:34,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 04:09:34,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:34,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:34,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:34,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:34,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:34,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:34,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:34,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:34,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:09:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:34,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:35,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3439 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:35,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3438 (Array Int Int)) (v_ArrVal_3439 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3438) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:35,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_156| Int) (v_ArrVal_3438 (Array Int Int)) (v_ArrVal_3439 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_156|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_156| v_ArrVal_3438) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296))) is different from false [2022-11-03 04:09:35,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3437 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_156| Int) (v_ArrVal_3438 (Array Int Int)) (v_ArrVal_3439 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3437) |v_thread1Thread1of1ForFork2_~#t2~0.base_156| v_ArrVal_3438) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_156|)))) is different from false [2022-11-03 04:09:35,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:35,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:09:35,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:35,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:09:35,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 222 [2022-11-03 04:09:35,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 206 [2022-11-03 04:09:35,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 04:09:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:09:35,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618023411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:35,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1030620666] [2022-11-03 04:09:35,361 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:35,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:35,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430531944] [2022-11-03 04:09:35,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=634, Unknown=4, NotChecked=212, Total=930 [2022-11-03 04:09:35,363 INFO L87 Difference]: Start difference. First operand 13055 states and 55010 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:35,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 8 c_~X_0~0.offset)) (.cse2 (select |c_#memory_int| c_~X_0~0.base))) (and (<= (select .cse0 8) 2147483647) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_156| Int) (v_ArrVal_3438 (Array Int Int)) (v_ArrVal_3439 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_156|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_156| v_ArrVal_3438) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) c_~X_0~0.base) .cse1) 4294967296))) (<= (select .cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (select .cse2 .cse1) 2147483647) (<= (select .cse2 8) 2147483647) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= c_~t_4~0 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:09:35,678 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 c_~X_0~0.offset)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_156| Int) (v_ArrVal_3438 (Array Int Int)) (v_ArrVal_3439 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_156|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_156| v_ArrVal_3438) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3439) c_~X_0~0.base) .cse0) 4294967296))) (<= (select .cse1 .cse0) 2147483647) (<= (select .cse1 8) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= c_~X_0~0.offset 0))) is different from false [2022-11-03 04:09:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:37,246 INFO L93 Difference]: Finished difference Result 22205 states and 91860 transitions. [2022-11-03 04:09:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:09:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:37,325 INFO L225 Difference]: With dead ends: 22205 [2022-11-03 04:09:37,325 INFO L226 Difference]: Without dead ends: 22205 [2022-11-03 04:09:37,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=1263, Unknown=6, NotChecked=462, Total=1892 [2022-11-03 04:09:37,326 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 369 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 611 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:37,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 260 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1878 Invalid, 0 Unknown, 611 Unchecked, 1.2s Time] [2022-11-03 04:09:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22205 states. [2022-11-03 04:09:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22205 to 13006. [2022-11-03 04:09:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13006 states, 12927 states have (on average 4.240581728165854) internal successors, (54818), 13005 states have internal predecessors, (54818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13006 states to 13006 states and 54818 transitions. [2022-11-03 04:09:37,695 INFO L78 Accepts]: Start accepts. Automaton has 13006 states and 54818 transitions. Word has length 17 [2022-11-03 04:09:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:37,695 INFO L495 AbstractCegarLoop]: Abstraction has 13006 states and 54818 transitions. [2022-11-03 04:09:37,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13006 states and 54818 transitions. [2022-11-03 04:09:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:37,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:37,699 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:37,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:37,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-11-03 04:09:37,900 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1934085946, now seen corresponding path program 3 times [2022-11-03 04:09:37,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:37,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633086850] [2022-11-03 04:09:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:38,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:38,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633086850] [2022-11-03 04:09:38,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633086850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:38,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364301386] [2022-11-03 04:09:38,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:09:38,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:38,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:38,315 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:38,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-11-03 04:09:38,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:09:38,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:09:38,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:38,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:38,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,660 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:38,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:09:38,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:38,855 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:38,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:38,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:38,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:38,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:38,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:39,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:39,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3499 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3499) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:39,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3499) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:39,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:39,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:09:39,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:39,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1235 treesize of output 1189 [2022-11-03 04:09:39,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1174 treesize of output 1110 [2022-11-03 04:09:39,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1110 treesize of output 1078 [2022-11-03 04:09:39,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 950 [2022-11-03 04:09:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364301386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747252307] [2022-11-03 04:09:40,625 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:40,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:40,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806814625] [2022-11-03 04:09:40,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:40,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:40,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=730, Unknown=3, NotChecked=110, Total=930 [2022-11-03 04:09:40,627 INFO L87 Difference]: Start difference. First operand 13006 states and 54818 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:42,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:42,631 INFO L93 Difference]: Finished difference Result 22470 states and 92061 transitions. [2022-11-03 04:09:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:09:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:42,721 INFO L225 Difference]: With dead ends: 22470 [2022-11-03 04:09:42,721 INFO L226 Difference]: Without dead ends: 22434 [2022-11-03 04:09:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=221, Invalid=1506, Unknown=3, NotChecked=162, Total=1892 [2022-11-03 04:09:42,722 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 444 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1098 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:42,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 297 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1709 Invalid, 0 Unknown, 1098 Unchecked, 1.1s Time] [2022-11-03 04:09:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2022-11-03 04:09:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 13836. [2022-11-03 04:09:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13836 states, 13757 states have (on average 4.277894889874246) internal successors, (58851), 13835 states have internal predecessors, (58851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13836 states to 13836 states and 58851 transitions. [2022-11-03 04:09:43,104 INFO L78 Accepts]: Start accepts. Automaton has 13836 states and 58851 transitions. Word has length 17 [2022-11-03 04:09:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:43,104 INFO L495 AbstractCegarLoop]: Abstraction has 13836 states and 58851 transitions. [2022-11-03 04:09:43,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13836 states and 58851 transitions. [2022-11-03 04:09:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:43,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:43,106 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:43,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:43,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:43,307 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1922787672, now seen corresponding path program 4 times [2022-11-03 04:09:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:43,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849290388] [2022-11-03 04:09:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:43,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849290388] [2022-11-03 04:09:43,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849290388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033044172] [2022-11-03 04:09:43,756 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:43,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:43,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:43,757 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:43,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-11-03 04:09:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:44,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:44,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:44,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:44,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:44,109 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:44,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:09:44,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:44,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:44,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:44,300 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:44,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:44,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:44,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:44,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:44,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:44,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:44,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3559 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3559) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:44,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3558) |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3559) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:44,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:44,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:09:44,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:44,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:09:44,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 254 [2022-11-03 04:09:44,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 119 [2022-11-03 04:09:44,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2022-11-03 04:09:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:45,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033044172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:45,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1330015772] [2022-11-03 04:09:45,026 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:45,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:45,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682265090] [2022-11-03 04:09:45,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=733, Unknown=3, NotChecked=110, Total=930 [2022-11-03 04:09:45,028 INFO L87 Difference]: Start difference. First operand 13836 states and 58851 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:46,950 INFO L93 Difference]: Finished difference Result 19306 states and 79707 transitions. [2022-11-03 04:09:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 04:09:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:47,013 INFO L225 Difference]: With dead ends: 19306 [2022-11-03 04:09:47,013 INFO L226 Difference]: Without dead ends: 19274 [2022-11-03 04:09:47,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=241, Invalid=1834, Unknown=3, NotChecked=178, Total=2256 [2022-11-03 04:09:47,013 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 597 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1014 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:47,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 235 Invalid, 2395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1303 Invalid, 0 Unknown, 1014 Unchecked, 1.0s Time] [2022-11-03 04:09:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2022-11-03 04:09:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 12266. [2022-11-03 04:09:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 12187 states have (on average 4.259456798227619) internal successors, (51910), 12265 states have internal predecessors, (51910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 51910 transitions. [2022-11-03 04:09:47,309 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 51910 transitions. Word has length 17 [2022-11-03 04:09:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:47,310 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 51910 transitions. [2022-11-03 04:09:47,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 51910 transitions. [2022-11-03 04:09:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:47,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:47,312 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:47,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:47,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:47,513 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:47,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 147198119, now seen corresponding path program 4 times [2022-11-03 04:09:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216973013] [2022-11-03 04:09:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:47,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:48,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216973013] [2022-11-03 04:09:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216973013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889564957] [2022-11-03 04:09:48,020 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:09:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:48,022 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:48,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-11-03 04:09:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:48,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:09:48,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:48,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:48,482 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:48,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:09:48,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:48,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:48,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:48,686 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:48,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:48,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:48,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:48,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:48,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:09:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:09:48,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:48,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3619 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3619) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:48,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3619 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3619) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:48,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3619 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3619) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:49,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:49,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:09:49,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:49,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 04:09:49,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 238 [2022-11-03 04:09:49,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 206 [2022-11-03 04:09:49,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 04:09:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:09:49,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889564957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:49,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1746616924] [2022-11-03 04:09:49,403 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:49,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:49,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737354273] [2022-11-03 04:09:49,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:49,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=691, Unknown=4, NotChecked=162, Total=930 [2022-11-03 04:09:49,406 INFO L87 Difference]: Start difference. First operand 12266 states and 51910 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:51,766 INFO L93 Difference]: Finished difference Result 17837 states and 72193 transitions. [2022-11-03 04:09:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 04:09:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:51,830 INFO L225 Difference]: With dead ends: 17837 [2022-11-03 04:09:51,831 INFO L226 Difference]: Without dead ends: 17805 [2022-11-03 04:09:51,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=257, Invalid=2007, Unknown=4, NotChecked=282, Total=2550 [2022-11-03 04:09:51,831 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 639 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1498 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:51,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 263 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1663 Invalid, 0 Unknown, 1498 Unchecked, 1.2s Time] [2022-11-03 04:09:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17805 states. [2022-11-03 04:09:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17805 to 10862. [2022-11-03 04:09:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10862 states, 10783 states have (on average 4.223592692200686) internal successors, (45543), 10861 states have internal predecessors, (45543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 45543 transitions. [2022-11-03 04:09:52,126 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 45543 transitions. Word has length 17 [2022-11-03 04:09:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:52,126 INFO L495 AbstractCegarLoop]: Abstraction has 10862 states and 45543 transitions. [2022-11-03 04:09:52,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 45543 transitions. [2022-11-03 04:09:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:52,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:52,128 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:52,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-11-03 04:09:52,328 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -816311047, now seen corresponding path program 1 times [2022-11-03 04:09:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:52,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234339013] [2022-11-03 04:09:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:52,659 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-03 04:09:52,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:52,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234339013] [2022-11-03 04:09:52,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234339013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:52,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728963129] [2022-11-03 04:09:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:52,660 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:52,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-11-03 04:09:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:52,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:09:52,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:53,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:53,021 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:09:53,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:09:53,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:53,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:53,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:53,190 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:53,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:09:53,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:53,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:09:53,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:09:53,350 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-03 04:09:53,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:53,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3679 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3679) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:53,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3678 (Array Int Int)) (v_ArrVal_3679 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3678) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3679) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:09:53,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:53,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:09:53,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:53,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 135 [2022-11-03 04:09:53,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:09:53,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 98 [2022-11-03 04:09:53,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-11-03 04:09:54,015 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-03 04:09:54,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728963129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:54,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426206094] [2022-11-03 04:09:54,015 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:54,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:54,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:54,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975454068] [2022-11-03 04:09:54,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:54,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:54,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:54,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:54,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=735, Unknown=3, NotChecked=110, Total=930 [2022-11-03 04:09:54,017 INFO L87 Difference]: Start difference. First operand 10862 states and 45543 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:55,925 INFO L93 Difference]: Finished difference Result 20484 states and 83980 transitions. [2022-11-03 04:09:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:09:55,925 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:09:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:55,996 INFO L225 Difference]: With dead ends: 20484 [2022-11-03 04:09:55,996 INFO L226 Difference]: Without dead ends: 20484 [2022-11-03 04:09:55,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=1608, Unknown=3, NotChecked=166, Total=1980 [2022-11-03 04:09:55,997 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 448 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 765 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:55,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 446 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1785 Invalid, 0 Unknown, 765 Unchecked, 1.1s Time] [2022-11-03 04:09:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20484 states. [2022-11-03 04:09:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20484 to 11842. [2022-11-03 04:09:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11842 states, 11763 states have (on average 4.298903340984443) internal successors, (50568), 11841 states have internal predecessors, (50568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 50568 transitions. [2022-11-03 04:09:56,307 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 50568 transitions. Word has length 17 [2022-11-03 04:09:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:56,307 INFO L495 AbstractCegarLoop]: Abstraction has 11842 states and 50568 transitions. [2022-11-03 04:09:56,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 50568 transitions. [2022-11-03 04:09:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:09:56,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:56,310 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:56,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:56,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-11-03 04:09:56,511 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:09:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash -816311050, now seen corresponding path program 1 times [2022-11-03 04:09:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:09:56,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221097875] [2022-11-03 04:09:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:09:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:56,850 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-03 04:09:56,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:09:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221097875] [2022-11-03 04:09:56,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221097875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:09:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865939391] [2022-11-03 04:09:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:56,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:09:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:09:56,851 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:09:56,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-11-03 04:09:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:57,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:09:57,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:57,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:09:57,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:57,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:57,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:57,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:57,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:57,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:57,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:09:57,482 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-03 04:09:57,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:57,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3736 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3736) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:57,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3735 (Array Int Int)) (v_ArrVal_3736 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3735) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3736) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:09:57,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_166| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_174| Int) (v_ArrVal_3735 (Array Int Int)) (v_ArrVal_3736 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_166|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_174|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_166| v_ArrVal_3735) |v_thread1Thread1of1ForFork2_~#t3~0.base_174| v_ArrVal_3736) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) is different from false [2022-11-03 04:09:57,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_166| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_174| Int) (v_ArrVal_3734 (Array Int Int)) (v_ArrVal_3735 (Array Int Int)) (v_ArrVal_3736 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3734) |v_thread1Thread1of1ForFork2_~#t2~0.base_166| v_ArrVal_3735) |v_thread1Thread1of1ForFork2_~#t3~0.base_174| v_ArrVal_3736) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_166|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_174|)))) is different from false [2022-11-03 04:09:57,636 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:57,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:09:57,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:09:57,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-03 04:09:57,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 582 treesize of output 550 [2022-11-03 04:09:57,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 550 treesize of output 486 [2022-11-03 04:09:57,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 486 treesize of output 470 [2022-11-03 04:09:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:09:59,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865939391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:09:59,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1035700672] [2022-11-03 04:09:59,074 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:09:59,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:09:59,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:09:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414180454] [2022-11-03 04:09:59,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:09:59,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:09:59,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:09:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:09:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=630, Unknown=4, NotChecked=212, Total=930 [2022-11-03 04:09:59,075 INFO L87 Difference]: Start difference. First operand 11842 states and 50568 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:09:59,235 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= 0 (+ (select .cse0 .cse1) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse0 8) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ c_~t_4~0 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_166| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_174| Int) (v_ArrVal_3734 (Array Int Int)) (v_ArrVal_3735 (Array Int Int)) (v_ArrVal_3736 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3734) |v_thread1Thread1of1ForFork2_~#t2~0.base_166| v_ArrVal_3735) |v_thread1Thread1of1ForFork2_~#t3~0.base_174| v_ArrVal_3736) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_166|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_174|)))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:09:59,248 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_166| Int) (|v_thread1Thread1of1ForFork2_~#t3~0.base_174| Int) (v_ArrVal_3735 (Array Int Int)) (v_ArrVal_3736 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_166|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_174|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_166| v_ArrVal_3735) |v_thread1Thread1of1ForFork2_~#t3~0.base_174| v_ArrVal_3736) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483648)) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:10:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:00,699 INFO L93 Difference]: Finished difference Result 18792 states and 75764 transitions. [2022-11-03 04:10:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:10:00,699 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:00,769 INFO L225 Difference]: With dead ends: 18792 [2022-11-03 04:10:00,769 INFO L226 Difference]: Without dead ends: 18764 [2022-11-03 04:10:00,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=1127, Unknown=6, NotChecked=438, Total=1722 [2022-11-03 04:10:00,769 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 436 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 628 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:00,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 352 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1832 Invalid, 0 Unknown, 628 Unchecked, 1.1s Time] [2022-11-03 04:10:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18764 states. [2022-11-03 04:10:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18764 to 12009. [2022-11-03 04:10:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12009 states, 11930 states have (on average 4.30184409052808) internal successors, (51321), 12008 states have internal predecessors, (51321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12009 states to 12009 states and 51321 transitions. [2022-11-03 04:10:01,098 INFO L78 Accepts]: Start accepts. Automaton has 12009 states and 51321 transitions. Word has length 17 [2022-11-03 04:10:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:01,098 INFO L495 AbstractCegarLoop]: Abstraction has 12009 states and 51321 transitions. [2022-11-03 04:10:01,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 12009 states and 51321 transitions. [2022-11-03 04:10:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:01,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:01,100 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:01,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:01,301 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -816279412, now seen corresponding path program 1 times [2022-11-03 04:10:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:01,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575793476] [2022-11-03 04:10:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:01,705 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-03 04:10:01,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:01,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575793476] [2022-11-03 04:10:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575793476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:01,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741365813] [2022-11-03 04:10:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:01,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:01,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:01,707 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:01,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-11-03 04:10:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:02,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:10:02,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:02,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:02,070 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:10:02,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:10:02,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:02,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:02,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:02,247 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:02,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:10:02,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:02,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:02,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:02,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:10:02,405 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-03 04:10:02,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:02,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3796 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:02,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3795 (Array Int Int)) (v_ArrVal_3796 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3795) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:02,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:02,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:10:02,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:02,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 04:10:02,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 122 [2022-11-03 04:10:02,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:10:02,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 54 [2022-11-03 04:10:03,082 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-03 04:10:03,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741365813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:03,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048189188] [2022-11-03 04:10:03,082 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:03,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:03,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723077797] [2022-11-03 04:10:03,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:03,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=729, Unknown=3, NotChecked=110, Total=930 [2022-11-03 04:10:03,085 INFO L87 Difference]: Start difference. First operand 12009 states and 51321 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:04,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:04,877 INFO L93 Difference]: Finished difference Result 17931 states and 73839 transitions. [2022-11-03 04:10:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 04:10:04,877 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:04,952 INFO L225 Difference]: With dead ends: 17931 [2022-11-03 04:10:04,952 INFO L226 Difference]: Without dead ends: 17931 [2022-11-03 04:10:04,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1987, Unknown=3, NotChecked=186, Total=2450 [2022-11-03 04:10:04,953 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 636 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1103 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:04,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 247 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1011 Invalid, 0 Unknown, 1103 Unchecked, 0.8s Time] [2022-11-03 04:10:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2022-11-03 04:10:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 12895. [2022-11-03 04:10:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12895 states, 12816 states have (on average 4.360642946317103) internal successors, (55886), 12894 states have internal predecessors, (55886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12895 states to 12895 states and 55886 transitions. [2022-11-03 04:10:05,348 INFO L78 Accepts]: Start accepts. Automaton has 12895 states and 55886 transitions. Word has length 17 [2022-11-03 04:10:05,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:05,349 INFO L495 AbstractCegarLoop]: Abstraction has 12895 states and 55886 transitions. [2022-11-03 04:10:05,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 12895 states and 55886 transitions. [2022-11-03 04:10:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:05,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:05,351 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:05,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:05,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:05,552 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -816279409, now seen corresponding path program 1 times [2022-11-03 04:10:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:05,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629212861] [2022-11-03 04:10:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:05,910 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-03 04:10:05,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629212861] [2022-11-03 04:10:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629212861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924157124] [2022-11-03 04:10:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:05,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:05,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:05,912 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:05,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-11-03 04:10:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:06,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:10:06,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:06,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:06,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:06,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:06,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:06,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:10:06,569 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-03 04:10:06,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:06,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3853 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3853) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:06,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3852) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3853) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:06,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_170| Int) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_178| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_170|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_170| v_ArrVal_3852) |v_thread1Thread1of1ForFork2_~#t3~0.base_178| v_ArrVal_3853) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_178|)))) is different from false [2022-11-03 04:10:06,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_170| Int) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_178| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_170|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3851) |v_thread1Thread1of1ForFork2_~#t2~0.base_170| v_ArrVal_3852) |v_thread1Thread1of1ForFork2_~#t3~0.base_178| v_ArrVal_3853) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_178|)))) is different from false [2022-11-03 04:10:06,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:06,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:10:06,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:06,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 135 [2022-11-03 04:10:06,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 114 [2022-11-03 04:10:06,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 98 [2022-11-03 04:10:06,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-11-03 04:10:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:10:06,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924157124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:06,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948288826] [2022-11-03 04:10:06,926 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:06,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:06,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:06,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613788977] [2022-11-03 04:10:06,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:06,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:06,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=630, Unknown=4, NotChecked=212, Total=930 [2022-11-03 04:10:06,928 INFO L87 Difference]: Start difference. First operand 12895 states and 55886 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:07,070 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_170| Int) (v_ArrVal_3851 (Array Int Int)) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_178| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_170|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3851) |v_thread1Thread1of1ForFork2_~#t2~0.base_170| v_ArrVal_3852) |v_thread1Thread1of1ForFork2_~#t3~0.base_178| v_ArrVal_3853) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_178|)))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= c_~t_5~0 2147483647) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-03 04:10:07,081 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_170| Int) (v_ArrVal_3852 (Array Int Int)) (v_ArrVal_3853 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_178| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_170|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_170| v_ArrVal_3852) |v_thread1Thread1of1ForFork2_~#t3~0.base_178| v_ArrVal_3853) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_178|)))) (= c_~X_0~0.offset 0)) is different from false [2022-11-03 04:10:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:08,218 INFO L93 Difference]: Finished difference Result 16702 states and 70154 transitions. [2022-11-03 04:10:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:10:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:08,284 INFO L225 Difference]: With dead ends: 16702 [2022-11-03 04:10:08,284 INFO L226 Difference]: Without dead ends: 16666 [2022-11-03 04:10:08,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1064, Unknown=6, NotChecked=426, Total=1640 [2022-11-03 04:10:08,284 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 529 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:08,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 241 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1337 Invalid, 0 Unknown, 560 Unchecked, 0.8s Time] [2022-11-03 04:10:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16666 states. [2022-11-03 04:10:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16666 to 12888. [2022-11-03 04:10:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12888 states, 12809 states have (on average 4.360605824029979) internal successors, (55855), 12887 states have internal predecessors, (55855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12888 states to 12888 states and 55855 transitions. [2022-11-03 04:10:08,600 INFO L78 Accepts]: Start accepts. Automaton has 12888 states and 55855 transitions. Word has length 17 [2022-11-03 04:10:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:08,600 INFO L495 AbstractCegarLoop]: Abstraction has 12888 states and 55855 transitions. [2022-11-03 04:10:08,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12888 states and 55855 transitions. [2022-11-03 04:10:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:08,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:08,602 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:08,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:08,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:08,803 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -592662322, now seen corresponding path program 1 times [2022-11-03 04:10:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:08,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044692470] [2022-11-03 04:10:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:09,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044692470] [2022-11-03 04:10:09,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044692470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:09,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7879628] [2022-11-03 04:10:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:09,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:09,169 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:09,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-11-03 04:10:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:09,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-03 04:10:09,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:09,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:09,629 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:10:09,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:10:09,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:09,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:09,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:09,796 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:09,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 04:10:09,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:09,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 04:10:09,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:09,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:10:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:09,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:10,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3915) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:10,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3915) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:10,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int)) (v_ArrVal_3914 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3914) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3915) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:10,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_180| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_172| Int) (v_ArrVal_3914 (Array Int Int))) (or (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_172| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_180|) 0)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_172|)) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_172| v_ArrVal_3914) |v_thread1Thread1of1ForFork2_~#t3~0.base_180| v_ArrVal_3915) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296))) is different from false [2022-11-03 04:10:10,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_180| Int) (v_ArrVal_3911 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_172| Int) (v_ArrVal_3914 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3911) |v_thread1Thread1of1ForFork2_~#t2~0.base_172| v_ArrVal_3914) |v_thread1Thread1of1ForFork2_~#t3~0.base_180| v_ArrVal_3915) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_172| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_180|) 0)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_172|)))) is different from false [2022-11-03 04:10:10,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:10,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:10:10,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:10,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 553 treesize of output 531 [2022-11-03 04:10:10,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 454 [2022-11-03 04:10:10,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 243 treesize of output 211 [2022-11-03 04:10:10,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 422 treesize of output 406 [2022-11-03 04:10:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:10:10,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7879628] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:10,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [793392624] [2022-11-03 04:10:10,978 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:10,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:10,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362182635] [2022-11-03 04:10:10,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:10,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=592, Unknown=5, NotChecked=260, Total=930 [2022-11-03 04:10:10,980 INFO L87 Difference]: Start difference. First operand 12888 states and 55855 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:13,127 INFO L93 Difference]: Finished difference Result 20191 states and 84099 transitions. [2022-11-03 04:10:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 04:10:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:13,195 INFO L225 Difference]: With dead ends: 20191 [2022-11-03 04:10:13,195 INFO L226 Difference]: Without dead ends: 20163 [2022-11-03 04:10:13,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=256, Invalid=1736, Unknown=8, NotChecked=450, Total=2450 [2022-11-03 04:10:13,196 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 720 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1311 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:13,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 301 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1456 Invalid, 0 Unknown, 1311 Unchecked, 1.0s Time] [2022-11-03 04:10:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20163 states. [2022-11-03 04:10:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20163 to 12684. [2022-11-03 04:10:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12684 states, 12605 states have (on average 4.359857199523998) internal successors, (54956), 12683 states have internal predecessors, (54956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12684 states to 12684 states and 54956 transitions. [2022-11-03 04:10:13,548 INFO L78 Accepts]: Start accepts. Automaton has 12684 states and 54956 transitions. Word has length 17 [2022-11-03 04:10:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:13,548 INFO L495 AbstractCegarLoop]: Abstraction has 12684 states and 54956 transitions. [2022-11-03 04:10:13,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12684 states and 54956 transitions. [2022-11-03 04:10:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:13,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:13,550 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:13,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:13,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:13,751 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -592662325, now seen corresponding path program 1 times [2022-11-03 04:10:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911267406] [2022-11-03 04:10:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:14,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:14,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911267406] [2022-11-03 04:10:14,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911267406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:14,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301022906] [2022-11-03 04:10:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:14,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:14,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:14,131 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:14,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-03 04:10:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:14,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 04:10:14,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:14,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:14,508 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:10:14,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:10:14,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:14,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:14,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:14,679 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:14,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 04:10:14,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:14,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:14,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:14,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:10:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:14,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:14,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3977 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3977) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:14,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3977 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3977) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:14,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3976 (Array Int Int)) (v_ArrVal_3977 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_3976) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_3977) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:14,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_182| Int) (v_ArrVal_3976 (Array Int Int)) (v_ArrVal_3977 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_174| Int)) (or (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_174| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_182|) 0)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_174|)) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_174| v_ArrVal_3976) |v_thread1Thread1of1ForFork2_~#t3~0.base_182| v_ArrVal_3977) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) is different from false [2022-11-03 04:10:14,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_182| Int) (v_ArrVal_3973 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (v_ArrVal_3977 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_174| Int)) (or (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_174| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_182|) 0)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_174|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3973) |v_thread1Thread1of1ForFork2_~#t2~0.base_174| v_ArrVal_3976) |v_thread1Thread1of1ForFork2_~#t3~0.base_182| v_ArrVal_3977) |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-03 04:10:14,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:14,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:10:14,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:14,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 311 treesize of output 301 [2022-11-03 04:10:14,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 254 [2022-11-03 04:10:14,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 119 [2022-11-03 04:10:15,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2022-11-03 04:10:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:10:15,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301022906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:15,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65572755] [2022-11-03 04:10:15,513 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:15,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:15,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210829277] [2022-11-03 04:10:15,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:15,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:15,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:15,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=592, Unknown=5, NotChecked=260, Total=930 [2022-11-03 04:10:15,514 INFO L87 Difference]: Start difference. First operand 12684 states and 54956 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:17,614 INFO L93 Difference]: Finished difference Result 20039 states and 82552 transitions. [2022-11-03 04:10:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 04:10:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:17,690 INFO L225 Difference]: With dead ends: 20039 [2022-11-03 04:10:17,690 INFO L226 Difference]: Without dead ends: 20039 [2022-11-03 04:10:17,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=1455, Unknown=8, NotChecked=410, Total=2070 [2022-11-03 04:10:17,691 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 391 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 926 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:17,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 381 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1785 Invalid, 0 Unknown, 926 Unchecked, 1.1s Time] [2022-11-03 04:10:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20039 states. [2022-11-03 04:10:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20039 to 12887. [2022-11-03 04:10:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12887 states, 12808 states have (on average 4.349781386633354) internal successors, (55712), 12886 states have internal predecessors, (55712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12887 states to 12887 states and 55712 transitions. [2022-11-03 04:10:18,033 INFO L78 Accepts]: Start accepts. Automaton has 12887 states and 55712 transitions. Word has length 17 [2022-11-03 04:10:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:18,034 INFO L495 AbstractCegarLoop]: Abstraction has 12887 states and 55712 transitions. [2022-11-03 04:10:18,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 12887 states and 55712 transitions. [2022-11-03 04:10:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:18,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:18,036 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:18,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-11-03 04:10:18,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:18,237 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:18,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash -592616272, now seen corresponding path program 2 times [2022-11-03 04:10:18,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:18,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785311813] [2022-11-03 04:10:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:18,599 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-03 04:10:18,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785311813] [2022-11-03 04:10:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785311813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034978670] [2022-11-03 04:10:18,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:10:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:18,600 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:18,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-03 04:10:19,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:10:19,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:10:19,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:10:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,137 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:10:19,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:10:19,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:19,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:19,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:19,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-03 04:10:19,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:19,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:19,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:19,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:10:19,495 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-03 04:10:19,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:19,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4037 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4037) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:19,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4037 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4037) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:19,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4036 (Array Int Int)) (v_ArrVal_4037 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_4036) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4037) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:19,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:19,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:10:19,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:19,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 619 treesize of output 597 [2022-11-03 04:10:19,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 582 treesize of output 518 [2022-11-03 04:10:19,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 518 treesize of output 502 [2022-11-03 04:10:19,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 502 treesize of output 470 [2022-11-03 04:10:20,147 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-03 04:10:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034978670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1883759941] [2022-11-03 04:10:20,148 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:20,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:20,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745086151] [2022-11-03 04:10:20,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=691, Unknown=4, NotChecked=162, Total=930 [2022-11-03 04:10:20,150 INFO L87 Difference]: Start difference. First operand 12887 states and 55712 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:21,944 INFO L93 Difference]: Finished difference Result 22646 states and 95424 transitions. [2022-11-03 04:10:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:10:21,945 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:22,039 INFO L225 Difference]: With dead ends: 22646 [2022-11-03 04:10:22,039 INFO L226 Difference]: Without dead ends: 22646 [2022-11-03 04:10:22,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=1541, Unknown=4, NotChecked=246, Total=1980 [2022-11-03 04:10:22,040 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 379 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 995 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:22,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 338 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1288 Invalid, 0 Unknown, 995 Unchecked, 0.9s Time] [2022-11-03 04:10:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22646 states. [2022-11-03 04:10:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22646 to 12886. [2022-11-03 04:10:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12886 states, 12807 states have (on average 4.347388147107051) internal successors, (55677), 12885 states have internal predecessors, (55677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 55677 transitions. [2022-11-03 04:10:22,398 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 55677 transitions. Word has length 17 [2022-11-03 04:10:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:22,398 INFO L495 AbstractCegarLoop]: Abstraction has 12886 states and 55677 transitions. [2022-11-03 04:10:22,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 55677 transitions. [2022-11-03 04:10:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:22,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:22,400 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:22,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:22,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-11-03 04:10:22,601 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -592616269, now seen corresponding path program 2 times [2022-11-03 04:10:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:22,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808347801] [2022-11-03 04:10:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:22,932 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-03 04:10:22,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808347801] [2022-11-03 04:10:22,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808347801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:22,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463086847] [2022-11-03 04:10:22,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:10:22,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:22,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:22,938 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:22,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-03 04:10:23,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:10:23,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:10:23,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:10:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:23,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:23,444 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-03 04:10:23,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-11-03 04:10:23,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:23,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:23,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:23,601 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:10:23,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:10:23,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 04:10:23,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:23,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:10:23,764 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-03 04:10:23,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:23,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4098 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4098) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:23,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4098 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4098) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:23,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4097 (Array Int Int)) (v_ArrVal_4098 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_4097) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4098) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:23,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:23,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:10:23,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:23,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 135 [2022-11-03 04:10:23,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 106 [2022-11-03 04:10:23,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-03 04:10:24,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-11-03 04:10:24,365 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-03 04:10:24,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463086847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:24,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183681012] [2022-11-03 04:10:24,365 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:24,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:24,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2022-11-03 04:10:24,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107813514] [2022-11-03 04:10:24,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:24,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 04:10:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:24,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 04:10:24,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=689, Unknown=4, NotChecked=162, Total=930 [2022-11-03 04:10:24,367 INFO L87 Difference]: Start difference. First operand 12886 states and 55677 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:26,346 INFO L93 Difference]: Finished difference Result 18385 states and 75791 transitions. [2022-11-03 04:10:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 04:10:26,347 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:26,408 INFO L225 Difference]: With dead ends: 18385 [2022-11-03 04:10:26,409 INFO L226 Difference]: Without dead ends: 18349 [2022-11-03 04:10:26,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=285, Invalid=2075, Unknown=4, NotChecked=288, Total=2652 [2022-11-03 04:10:26,409 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 647 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1254 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:26,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 316 Invalid, 2646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1304 Invalid, 0 Unknown, 1254 Unchecked, 0.9s Time] [2022-11-03 04:10:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18349 states. [2022-11-03 04:10:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18349 to 12190. [2022-11-03 04:10:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12190 states, 12111 states have (on average 4.299397242176534) internal successors, (52070), 12189 states have internal predecessors, (52070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12190 states to 12190 states and 52070 transitions. [2022-11-03 04:10:26,891 INFO L78 Accepts]: Start accepts. Automaton has 12190 states and 52070 transitions. Word has length 17 [2022-11-03 04:10:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:26,891 INFO L495 AbstractCegarLoop]: Abstraction has 12190 states and 52070 transitions. [2022-11-03 04:10:26,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 12190 states and 52070 transitions. [2022-11-03 04:10:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:26,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:26,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:26,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:27,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2022-11-03 04:10:27,094 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1689851953, now seen corresponding path program 1 times [2022-11-03 04:10:27,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:27,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664294954] [2022-11-03 04:10:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:27,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:27,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:27,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664294954] [2022-11-03 04:10:27,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664294954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:27,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568308805] [2022-11-03 04:10:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:27,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:27,550 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:27,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-11-03 04:10:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:27,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:10:27,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:27,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:27,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:27,938 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:10:27,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-03 04:10:27,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:28,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:28,106 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:28,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 04:10:28,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:28,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-03 04:10:28,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:28,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:28,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:10:28,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-11-03 04:10:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:28,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:28,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4161 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4161) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:28,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4160 (Array Int Int)) (v_ArrVal_4161 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4160) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4161) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:28,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (v_ArrVal_4161 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_4159) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4160) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4161) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-11-03 04:10:28,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_180| Int) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (v_ArrVal_4161 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_188| Int)) (or (< (select (select (store (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_180| v_ArrVal_4159) |v_thread1Thread1of1ForFork2_~#t3~0.base_188| v_ArrVal_4160) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4161) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296) (not (= 0 (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_180| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_188|))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_180|)))) is different from false [2022-11-03 04:10:28,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_180| Int) (v_ArrVal_4156 (Array Int Int)) (v_ArrVal_4159 (Array Int Int)) (v_ArrVal_4160 (Array Int Int)) (v_ArrVal_4161 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_188| Int)) (or (not (= 0 (select (store |c_#valid| |v_thread1Thread1of1ForFork2_~#t2~0.base_180| 1) |v_thread1Thread1of1ForFork2_~#t3~0.base_188|))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_180|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4156) |v_thread1Thread1of1ForFork2_~#t2~0.base_180| v_ArrVal_4159) |v_thread1Thread1of1ForFork2_~#t3~0.base_188| v_ArrVal_4160) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4161) |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-03 04:10:28,446 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:28,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-03 04:10:28,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:28,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 271 [2022-11-03 04:10:28,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 258 treesize of output 226 [2022-11-03 04:10:28,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 210 [2022-11-03 04:10:28,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 [2022-11-03 04:10:28,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 198 [2022-11-03 04:10:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:10:28,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568308805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:10:28,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1328243408] [2022-11-03 04:10:28,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:10:28,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:10:28,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-11-03 04:10:28,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681593650] [2022-11-03 04:10:28,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:10:28,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 04:10:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:10:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 04:10:28,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=441, Unknown=5, NotChecked=230, Total=756 [2022-11-03 04:10:28,970 INFO L87 Difference]: Start difference. First operand 12190 states and 52070 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:10:30,449 INFO L93 Difference]: Finished difference Result 21630 states and 90149 transitions. [2022-11-03 04:10:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:10:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 04:10:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:10:30,524 INFO L225 Difference]: With dead ends: 21630 [2022-11-03 04:10:30,524 INFO L226 Difference]: Without dead ends: 21630 [2022-11-03 04:10:30,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=817, Unknown=7, NotChecked=320, Total=1332 [2022-11-03 04:10:30,525 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 409 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:10:30,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 116 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 746 Invalid, 0 Unknown, 826 Unchecked, 0.6s Time] [2022-11-03 04:10:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21630 states. [2022-11-03 04:10:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21630 to 12969. [2022-11-03 04:10:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12969 states, 12890 states have (on average 4.314817688130334) internal successors, (55618), 12968 states have internal predecessors, (55618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12969 states to 12969 states and 55618 transitions. [2022-11-03 04:10:30,868 INFO L78 Accepts]: Start accepts. Automaton has 12969 states and 55618 transitions. Word has length 17 [2022-11-03 04:10:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:10:30,869 INFO L495 AbstractCegarLoop]: Abstraction has 12969 states and 55618 transitions. [2022-11-03 04:10:30,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:10:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12969 states and 55618 transitions. [2022-11-03 04:10:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:10:30,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:10:30,872 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:10:30,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-11-03 04:10:31,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:31,073 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-11-03 04:10:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:10:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1689851956, now seen corresponding path program 1 times [2022-11-03 04:10:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:10:31,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319333285] [2022-11-03 04:10:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:10:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:31,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:10:31,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319333285] [2022-11-03 04:10:31,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319333285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:31,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740599100] [2022-11-03 04:10:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:31,391 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:31,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_218cf2f0-08c5-474c-908d-891ed20c2ff0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-03 04:10:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:31,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:10:31,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:31,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:10:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:31,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:31,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:31,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:32,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:32,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:32,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:32,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:32,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 [2022-11-03 04:10:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:32,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:32,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4219 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4219) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:32,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4218 (Array Int Int)) (v_ArrVal_4219 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4218) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4219) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:32,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (v_ArrVal_4219 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_4217) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_4218) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4219) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-11-03 04:10:32,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_190| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_182| Int) (v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (v_ArrVal_4219 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_182| v_ArrVal_4217) |v_thread1Thread1of1ForFork2_~#t3~0.base_190| v_ArrVal_4218) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4219) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_182|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_190|)))) is different from false [2022-11-03 04:10:32,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_190| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_182| Int) (v_ArrVal_4216 (Array Int Int)) (v_ArrVal_4217 (Array Int Int)) (v_ArrVal_4218 (Array Int Int)) (v_ArrVal_4219 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4216) |v_thread1Thread1of1ForFork2_~#t2~0.base_182| v_ArrVal_4217) |v_thread1Thread1of1ForFork2_~#t3~0.base_190| v_ArrVal_4218) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_4219) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_182|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_190|)))) is different from false [2022-11-03 04:10:32,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:32,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:10:32,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:10:32,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78339 treesize of output 76805 [2022-11-03 04:10:32,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38395 treesize of output 37371 [2022-11-03 04:10:32,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75766 treesize of output 73718 [2022-11-03 04:10:33,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73718 treesize of output 69622 [2022-11-03 04:10:33,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69622 treesize of output 61430