./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9 --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:49:28,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:49:28,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:49:28,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:49:28,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:49:28,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:49:28,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:49:28,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:49:28,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:49:28,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:49:28,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:49:28,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:49:28,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:49:28,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:49:28,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:49:28,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:49:28,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:49:28,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:49:28,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:49:28,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:49:28,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:49:28,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:49:28,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:49:28,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:49:28,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:49:28,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:49:28,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:49:28,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:49:28,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:49:28,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:49:28,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:49:28,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:49:28,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:49:28,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:49:28,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:49:28,495 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:49:28,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:49:28,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:49:28,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:49:28,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:49:28,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:49:28,499 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-20 20:49:28,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:49:28,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:49:28,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:49:28,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:49:28,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:49:28,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:49:28,524 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:49:28,524 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:49:28,524 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:49:28,541 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:49:28,542 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:49:28,542 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:49:28,542 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:49:28,543 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:49:28,544 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:49:28,544 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:49:28,544 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:49:28,545 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:49:28,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:49:28,546 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:49:28,546 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:49:28,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:49:28,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:49:28,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:49:28,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:49:28,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:49:28,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:49:28,548 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 20:49:28,549 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:49:28,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:49:28,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:49:28,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:49:28,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:49:28,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:49:28,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:49:28,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:49:28,551 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:49:28,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:49:28,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:49:28,552 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:49:28,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:49:28,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:49:28,553 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:49:28,553 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_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-20 20:49:28,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:49:28,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:49:28,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:49:28,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:49:28,827 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:49:28,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 20:49:31,953 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:49:32,329 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:49:32,330 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 20:49:32,355 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/data/b4f9ec817/5280ff1ee8bc409582e8e555637e9b7e/FLAG0517a6ec5 [2022-11-20 20:49:32,371 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/data/b4f9ec817/5280ff1ee8bc409582e8e555637e9b7e [2022-11-20 20:49:32,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:49:32,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:49:32,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:49:32,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:49:32,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:49:32,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:49:32" (1/1) ... [2022-11-20 20:49:32,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1655b526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:32, skipping insertion in model container [2022-11-20 20:49:32,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:49:32" (1/1) ... [2022-11-20 20:49:32,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:49:32,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:49:32,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 20:49:32,971 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 20:49:32,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:49:32,989 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:49:33,036 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 20:49:33,040 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 20:49:33,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:49:33,094 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:49:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33 WrapperNode [2022-11-20 20:49:33,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:49:33,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:49:33,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:49:33,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:49:33,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,151 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-20 20:49:33,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:49:33,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:49:33,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:49:33,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:49:33,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:49:33,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:49:33,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:49:33,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:49:33,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (1/1) ... [2022-11-20 20:49:33,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:49:33,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:49:33,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:49:33,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:49:33,277 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 20:49:33,277 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 20:49:33,277 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 20:49:33,278 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 20:49:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:49:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:49:33,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:49:33,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:49:33,281 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:49:33,454 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:49:33,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:49:33,970 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:49:33,981 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:49:33,982 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 20:49:33,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:49:33 BoogieIcfgContainer [2022-11-20 20:49:33,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:49:33,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:49:33,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:49:33,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:49:33,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:49:32" (1/3) ... [2022-11-20 20:49:33,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad34493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:49:33, skipping insertion in model container [2022-11-20 20:49:33,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:49:33" (2/3) ... [2022-11-20 20:49:33,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad34493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:49:33, skipping insertion in model container [2022-11-20 20:49:33,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:49:33" (3/3) ... [2022-11-20 20:49:33,997 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-20 20:49:34,008 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 20:49:34,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:49:34,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-20 20:49:34,023 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:49:34,172 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 20:49:34,240 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:49:34,266 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-20 20:49:34,270 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-20 20:49:34,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-20 20:49:34,500 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-20 20:49:34,500 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 20:49:34,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-20 20:49:34,526 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-20 20:49:45,650 INFO L134 LiptonReduction]: Checked pairs total: 29976 [2022-11-20 20:49:45,651 INFO L136 LiptonReduction]: Total number of compositions: 235 [2022-11-20 20:49:45,661 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-20 20:49:45,745 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:45,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:49:45,771 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;@717f00be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:49:45,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-20 20:49:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:49:45,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:45,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:45,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:45,790 INFO L85 PathProgramCache]: Analyzing trace with hash -261748653, now seen corresponding path program 1 times [2022-11-20 20:49:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944038223] [2022-11-20 20:49:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:47,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944038223] [2022-11-20 20:49:47,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944038223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:47,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:47,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:49:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265434961] [2022-11-20 20:49:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:47,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:49:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:49:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:49:47,613 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:48,151 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-20 20:49:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:48,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 20:49:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:48,177 INFO L225 Difference]: With dead ends: 1168 [2022-11-20 20:49:48,177 INFO L226 Difference]: Without dead ends: 1168 [2022-11-20 20:49:48,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:48,181 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:49:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-20 20:49:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-20 20:49:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-20 20:49:48,306 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-20 20:49:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:48,307 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-20 20:49:48,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-20 20:49:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:49:48,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:48,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:48,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:49:48,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131929, now seen corresponding path program 1 times [2022-11-20 20:49:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922764408] [2022-11-20 20:49:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:49,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:49,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922764408] [2022-11-20 20:49:49,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922764408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:49,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:49,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:49:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821453575] [2022-11-20 20:49:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:49,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:49:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:49:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:49,208 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:49,661 INFO L93 Difference]: Finished difference Result 1584 states and 4180 transitions. [2022-11-20 20:49:49,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:49,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:49,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:49,675 INFO L225 Difference]: With dead ends: 1584 [2022-11-20 20:49:49,675 INFO L226 Difference]: Without dead ends: 1584 [2022-11-20 20:49:49,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:49,677 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:49,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 36 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:49:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2022-11-20 20:49:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1328. [2022-11-20 20:49:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.8109375) internal successors, (3598), 1327 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3598 transitions. [2022-11-20 20:49:49,743 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3598 transitions. Word has length 8 [2022-11-20 20:49:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:49,743 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3598 transitions. [2022-11-20 20:49:49,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3598 transitions. [2022-11-20 20:49:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:49:49,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:49,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:49,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:49:49,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131930, now seen corresponding path program 1 times [2022-11-20 20:49:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:49,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604411817] [2022-11-20 20:49:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:50,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:50,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604411817] [2022-11-20 20:49:50,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604411817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:50,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:50,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:49:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620222389] [2022-11-20 20:49:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:50,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:49:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:49:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:50,526 INFO L87 Difference]: Start difference. First operand 1328 states and 3598 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:50,926 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-20 20:49:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:50,936 INFO L225 Difference]: With dead ends: 1537 [2022-11-20 20:49:50,936 INFO L226 Difference]: Without dead ends: 1537 [2022-11-20 20:49:50,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:50,937 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 36 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:49:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-20 20:49:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-20 20:49:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-20 20:49:50,985 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-20 20:49:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:50,985 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-20 20:49:50,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-20 20:49:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:49:50,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:50,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:49:50,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 475825829, now seen corresponding path program 2 times [2022-11-20 20:49:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:50,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378236543] [2022-11-20 20:49:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:51,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:51,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378236543] [2022-11-20 20:49:51,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378236543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:51,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:51,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:49:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307797040] [2022-11-20 20:49:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:51,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:49:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:51,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:49:51,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:51,816 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:52,470 INFO L93 Difference]: Finished difference Result 1572 states and 4148 transitions. [2022-11-20 20:49:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:52,480 INFO L225 Difference]: With dead ends: 1572 [2022-11-20 20:49:52,480 INFO L226 Difference]: Without dead ends: 1572 [2022-11-20 20:49:52,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:52,482 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:52,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:49:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-20 20:49:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1328. [2022-11-20 20:49:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-20 20:49:52,529 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-20 20:49:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:52,529 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-20 20:49:52,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-20 20:49:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 20:49:52,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:52,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:49:52,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 475729109, now seen corresponding path program 3 times [2022-11-20 20:49:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:52,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810814692] [2022-11-20 20:49:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:53,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810814692] [2022-11-20 20:49:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810814692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:49:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942485232] [2022-11-20 20:49:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:53,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:49:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:49:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:53,339 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:53,998 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-20 20:49:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:54,008 INFO L225 Difference]: With dead ends: 1537 [2022-11-20 20:49:54,009 INFO L226 Difference]: Without dead ends: 1537 [2022-11-20 20:49:54,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:54,010 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:54,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 20:49:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-20 20:49:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-20 20:49:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-20 20:49:54,056 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-20 20:49:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:54,057 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-20 20:49:54,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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-20 20:49:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-20 20:49:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:49:54,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:54,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:54,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:49:54,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1933921403, now seen corresponding path program 1 times [2022-11-20 20:49:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:54,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720837379] [2022-11-20 20:49:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:54,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:54,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720837379] [2022-11-20 20:49:54,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720837379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:54,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:54,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:49:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298139615] [2022-11-20 20:49:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:49:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:49:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:49:54,109 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) 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-20 20:49:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:54,352 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-20 20:49:54,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:49:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) 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-20 20:49:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:54,366 INFO L225 Difference]: With dead ends: 2154 [2022-11-20 20:49:54,366 INFO L226 Difference]: Without dead ends: 2154 [2022-11-20 20:49:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:49:54,367 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 26 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:49:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-20 20:49:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-20 20:49:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-20 20:49:54,458 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-20 20:49:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:54,459 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-20 20:49:54,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) 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-20 20:49:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-20 20:49:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:49:54,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:54,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:54,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:49:54,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1903415787, now seen corresponding path program 1 times [2022-11-20 20:49:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:54,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532044524] [2022-11-20 20:49:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:54,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532044524] [2022-11-20 20:49:54,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532044524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:54,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:54,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:49:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661693111] [2022-11-20 20:49:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:54,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:49:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:49:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:49:54,952 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:55,278 INFO L93 Difference]: Finished difference Result 2177 states and 6018 transitions. [2022-11-20 20:49:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:49:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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-20 20:49:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:55,291 INFO L225 Difference]: With dead ends: 2177 [2022-11-20 20:49:55,291 INFO L226 Difference]: Without dead ends: 2177 [2022-11-20 20:49:55,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-20 20:49:55,293 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:55,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:49:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-11-20 20:49:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1953. [2022-11-20 20:49:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-20 20:49:55,360 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-20 20:49:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:55,360 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-20 20:49:55,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-20 20:49:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:49:55,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:55,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:49:55,362 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -155840155, now seen corresponding path program 1 times [2022-11-20 20:49:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:55,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522413006] [2022-11-20 20:49:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:55,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:55,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:55,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522413006] [2022-11-20 20:49:55,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522413006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:55,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:55,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:49:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123391995] [2022-11-20 20:49:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:55,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:49:55,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:49:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:55,795 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:56,196 INFO L93 Difference]: Finished difference Result 2675 states and 7297 transitions. [2022-11-20 20:49:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:49:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 11 [2022-11-20 20:49:56,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:56,216 INFO L225 Difference]: With dead ends: 2675 [2022-11-20 20:49:56,216 INFO L226 Difference]: Without dead ends: 2675 [2022-11-20 20:49:56,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:49:56,217 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:56,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 45 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:49:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2022-11-20 20:49:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2198. [2022-11-20 20:49:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2150 states have (on average 2.8567441860465115) internal successors, (6142), 2197 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 6142 transitions. [2022-11-20 20:49:56,305 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 6142 transitions. Word has length 11 [2022-11-20 20:49:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:56,306 INFO L495 AbstractCegarLoop]: Abstraction has 2198 states and 6142 transitions. [2022-11-20 20:49:56,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 6142 transitions. [2022-11-20 20:49:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:49:56,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:56,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:56,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:49:56,308 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:56,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1222541532, now seen corresponding path program 1 times [2022-11-20 20:49:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:56,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724840146] [2022-11-20 20:49:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:56,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724840146] [2022-11-20 20:49:56,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724840146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:56,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:56,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:49:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768230043] [2022-11-20 20:49:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:56,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:49:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:49:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:49:56,362 INFO L87 Difference]: Start difference. First operand 2198 states and 6142 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-20 20:49:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:56,442 INFO L93 Difference]: Finished difference Result 614 states and 1423 transitions. [2022-11-20 20:49:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:49:56,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 11 [2022-11-20 20:49:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:56,456 INFO L225 Difference]: With dead ends: 614 [2022-11-20 20:49:56,456 INFO L226 Difference]: Without dead ends: 592 [2022-11-20 20:49:56,456 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-20 20:49:56,457 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:56,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:49:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-20 20:49:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-11-20 20:49:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-20 20:49:56,475 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-20 20:49:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:56,476 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-20 20:49:56,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-20 20:49:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-20 20:49:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:49:56,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:56,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:49:56,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1932122713, now seen corresponding path program 2 times [2022-11-20 20:49:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:56,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008091559] [2022-11-20 20:49:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:57,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008091559] [2022-11-20 20:49:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008091559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:57,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:49:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862758757] [2022-11-20 20:49:57,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:57,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:49:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:49:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:57,153 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:57,401 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-20 20:49:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:57,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 11 [2022-11-20 20:49:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:57,405 INFO L225 Difference]: With dead ends: 820 [2022-11-20 20:49:57,405 INFO L226 Difference]: Without dead ends: 820 [2022-11-20 20:49:57,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:49:57,406 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:57,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 23 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:49:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-20 20:49:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-20 20:49:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-20 20:49:57,442 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-20 20:49:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:57,443 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-20 20:49:57,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-20 20:49:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:49:57,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:57,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:57,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:49:57,446 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1121752697, now seen corresponding path program 3 times [2022-11-20 20:49:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:57,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193898720] [2022-11-20 20:49:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:58,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193898720] [2022-11-20 20:49:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193898720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:58,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:58,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:49:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045867053] [2022-11-20 20:49:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:58,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 20:49:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 20:49:58,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:49:58,012 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:58,321 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2022-11-20 20:49:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:49:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 11 [2022-11-20 20:49:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:58,326 INFO L225 Difference]: With dead ends: 798 [2022-11-20 20:49:58,326 INFO L226 Difference]: Without dead ends: 798 [2022-11-20 20:49:58,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:49:58,327 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:58,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 27 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:49:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-20 20:49:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 570. [2022-11-20 20:49:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-20 20:49:58,347 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-20 20:49:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:58,348 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-20 20:49:58,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 20:49:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-20 20:49:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:49:58,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:58,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:58,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 20:49:58,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1796091972, now seen corresponding path program 1 times [2022-11-20 20:49:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:58,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156459223] [2022-11-20 20:49:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:58,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:58,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156459223] [2022-11-20 20:49:58,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156459223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:49:58,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:49:58,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:49:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376067941] [2022-11-20 20:49:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:49:58,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:49:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:49:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:49:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:49:58,405 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:49:58,558 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-20 20:49:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:49:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:49:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:49:58,561 INFO L225 Difference]: With dead ends: 606 [2022-11-20 20:49:58,561 INFO L226 Difference]: Without dead ends: 606 [2022-11-20 20:49:58,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:49:58,562 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:49:58,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:49:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-20 20:49:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-20 20:49:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-20 20:49:58,580 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-20 20:49:58,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:49:58,580 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-20 20:49:58,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:49:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-20 20:49:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:49:58,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:49:58,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:49:58,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 20:49:58,582 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:49:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:49:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash -664587904, now seen corresponding path program 1 times [2022-11-20 20:49:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:49:58,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446511500] [2022-11-20 20:49:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:49:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:49:59,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:49:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446511500] [2022-11-20 20:49:59,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446511500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:49:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035547147] [2022-11-20 20:49:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:49:59,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:49:59,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:49:59,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:49:59,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:49:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:49:59,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:49:59,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:49:59,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:49:59,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:49:59,719 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:49:59,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:49:59,737 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:49:59,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:49:59,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:50:00,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 20:50:00,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:50:00,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:00,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:50:00,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:50:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:00,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:01,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 1608 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_468 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 20:50:01,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_466) .cse1 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_466 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_468) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2022-11-20 20:50:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:50:01,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035547147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:01,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61493108] [2022-11-20 20:50:01,907 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:01,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:01,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 20:50:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353133403] [2022-11-20 20:50:01,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:01,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 20:50:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 20:50:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=554, Unknown=19, NotChecked=102, Total=812 [2022-11-20 20:50:01,916 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-20 20:50:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:02,788 INFO L93 Difference]: Finished difference Result 609 states and 1414 transitions. [2022-11-20 20:50:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:50:02,789 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-20 20:50:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:02,791 INFO L225 Difference]: With dead ends: 609 [2022-11-20 20:50:02,792 INFO L226 Difference]: Without dead ends: 609 [2022-11-20 20:50:02,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=881, Unknown=19, NotChecked=130, Total=1260 [2022-11-20 20:50:02,793 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:02,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 392 Unchecked, 0.2s Time] [2022-11-20 20:50:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-20 20:50:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2022-11-20 20:50:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 591 states have (on average 2.3925549915397633) internal successors, (1414), 608 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1414 transitions. [2022-11-20 20:50:02,816 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1414 transitions. Word has length 16 [2022-11-20 20:50:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:02,818 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1414 transitions. [2022-11-20 20:50:02,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-20 20:50:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1414 transitions. [2022-11-20 20:50:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 20:50:02,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:02,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:02,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:50:03,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:03,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -664587903, now seen corresponding path program 1 times [2022-11-20 20:50:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:03,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125237830] [2022-11-20 20:50:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:04,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125237830] [2022-11-20 20:50:04,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125237830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502932988] [2022-11-20 20:50:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:04,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:04,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:50:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:04,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 20:50:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:04,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:04,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:04,536 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:50:04,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:50:04,551 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:50:04,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:50:04,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:50:04,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:50:05,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:50:05,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:05,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:50:05,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:50:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:05,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:05,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_564 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:50:05,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_562) .cse1 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_562 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_564) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:50:08,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_561 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_561)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_562) .cse2 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_562) (< (+ (select .cse0 .cse2) 1) v_ArrVal_564) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:50:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:50:16,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502932988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:16,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359763703] [2022-11-20 20:50:16,721 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:16,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:16,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-20 20:50:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065462290] [2022-11-20 20:50:16,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:16,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 20:50:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:16,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 20:50:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=622, Unknown=22, NotChecked=174, Total=1056 [2022-11-20 20:50:16,730 INFO L87 Difference]: Start difference. First operand 609 states and 1414 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-20 20:50:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:17,587 INFO L93 Difference]: Finished difference Result 620 states and 1427 transitions. [2022-11-20 20:50:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:50:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-20 20:50:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:17,590 INFO L225 Difference]: With dead ends: 620 [2022-11-20 20:50:17,591 INFO L226 Difference]: Without dead ends: 620 [2022-11-20 20:50:17,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=353, Invalid=897, Unknown=22, NotChecked=210, Total=1482 [2022-11-20 20:50:17,592 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:17,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 93 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 247 Invalid, 0 Unknown, 596 Unchecked, 0.3s Time] [2022-11-20 20:50:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-20 20:50:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 609. [2022-11-20 20:50:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 591 states have (on average 2.3908629441624365) internal successors, (1413), 608 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1413 transitions. [2022-11-20 20:50:17,611 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1413 transitions. Word has length 16 [2022-11-20 20:50:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:17,611 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1413 transitions. [2022-11-20 20:50:17,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 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-20 20:50:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1413 transitions. [2022-11-20 20:50:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:50:17,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:17,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:17,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:50:17,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:17,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688262, now seen corresponding path program 1 times [2022-11-20 20:50:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:17,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16284055] [2022-11-20 20:50:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:18,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16284055] [2022-11-20 20:50:18,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16284055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377243942] [2022-11-20 20:50:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:18,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:18,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:50:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 20:50:18,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:18,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:18,756 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:50:18,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:50:18,788 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:50:18,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:50:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 20:50:18,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:50:19,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 20:50:19,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:50:19,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:19,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:50:19,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:50:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:19,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:20,880 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_664 Int) (v_ArrVal_669 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_671 Int) (v_ArrVal_667 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_664)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_665) .cse1 v_ArrVal_667)) |c_~#stored_elements~0.base| v_ArrVal_669) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_667) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ v_ArrVal_665 2147483648) 0) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_671) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-11-20 20:50:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:50:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377243942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [42927816] [2022-11-20 20:50:22,227 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:22,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:22,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2022-11-20 20:50:22,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048563780] [2022-11-20 20:50:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:22,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 20:50:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 20:50:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=573, Unknown=28, NotChecked=52, Total=812 [2022-11-20 20:50:22,230 INFO L87 Difference]: Start difference. First operand 609 states and 1413 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 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-20 20:50:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:23,193 INFO L93 Difference]: Finished difference Result 840 states and 1970 transitions. [2022-11-20 20:50:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:50:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 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-20 20:50:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:23,197 INFO L225 Difference]: With dead ends: 840 [2022-11-20 20:50:23,197 INFO L226 Difference]: Without dead ends: 840 [2022-11-20 20:50:23,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=319, Invalid=989, Unknown=28, NotChecked=70, Total=1406 [2022-11-20 20:50:23,198 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 342 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1223 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:23,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 129 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 381 Invalid, 0 Unknown, 1223 Unchecked, 0.4s Time] [2022-11-20 20:50:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-11-20 20:50:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 719. [2022-11-20 20:50:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 701 states have (on average 2.3951497860199713) internal successors, (1679), 718 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1679 transitions. [2022-11-20 20:50:23,217 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1679 transitions. Word has length 17 [2022-11-20 20:50:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:23,218 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 1679 transitions. [2022-11-20 20:50:23,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 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-20 20:50:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1679 transitions. [2022-11-20 20:50:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:50:23,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:23,219 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:23,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:50:23,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 20:50:23,426 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688261, now seen corresponding path program 1 times [2022-11-20 20:50:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:23,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054021863] [2022-11-20 20:50:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:23,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:24,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:24,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054021863] [2022-11-20 20:50:24,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054021863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049256090] [2022-11-20 20:50:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:24,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:24,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:24,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:24,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:50:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:24,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:50:24,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:24,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:24,815 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:50:24,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:50:24,840 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:50:24,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:50:24,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 20:50:25,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:50:25,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:50:25,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:50:25,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:25,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:50:25,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:50:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:25,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:26,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_771 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 20:50:26,080 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_771) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:50:26,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_768) .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_771) (not (<= v_ArrVal_768 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:50:26,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_766 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_766)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_768) .cse3 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_768) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_771) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:50:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:50:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049256090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1498720501] [2022-11-20 20:50:34,834 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:34,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:50:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638332159] [2022-11-20 20:50:34,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:34,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:50:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:34,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:50:34,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=725, Unknown=26, NotChecked=252, Total=1260 [2022-11-20 20:50:34,838 INFO L87 Difference]: Start difference. First operand 719 states and 1679 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:35,460 INFO L93 Difference]: Finished difference Result 899 states and 2083 transitions. [2022-11-20 20:50:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:50:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:35,463 INFO L225 Difference]: With dead ends: 899 [2022-11-20 20:50:35,463 INFO L226 Difference]: Without dead ends: 899 [2022-11-20 20:50:35,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=349, Invalid=901, Unknown=26, NotChecked=284, Total=1560 [2022-11-20 20:50:35,465 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 170 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 853 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:35,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 98 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 853 Unchecked, 0.2s Time] [2022-11-20 20:50:35,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-11-20 20:50:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 819. [2022-11-20 20:50:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 801 states have (on average 2.387016229712859) internal successors, (1912), 818 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1912 transitions. [2022-11-20 20:50:35,488 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1912 transitions. Word has length 17 [2022-11-20 20:50:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:35,488 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1912 transitions. [2022-11-20 20:50:35,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1912 transitions. [2022-11-20 20:50:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:50:35,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:35,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:35,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 20:50:35,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:50:35,696 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1846649884, now seen corresponding path program 2 times [2022-11-20 20:50:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:35,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531655534] [2022-11-20 20:50:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:36,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:36,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531655534] [2022-11-20 20:50:36,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531655534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:36,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105914605] [2022-11-20 20:50:36,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:50:36,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:36,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:36,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:36,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:50:37,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:50:37,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:50:37,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 20:50:37,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:37,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:50:37,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 20:50:37,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:37,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 20:50:37,456 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 20:50:37,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 20:50:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:37,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:37,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_858 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_857) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_858) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_858 2147483648) 0))) is different from false [2022-11-20 20:50:37,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:37,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-20 20:50:37,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:37,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-20 20:50:37,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 20:50:37,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 20:50:37,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:37,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-11-20 20:50:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:38,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105914605] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:38,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [994419622] [2022-11-20 20:50:38,041 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:38,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:38,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-11-20 20:50:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414083120] [2022-11-20 20:50:38,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:38,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 20:50:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 20:50:38,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=444, Unknown=6, NotChecked=44, Total=600 [2022-11-20 20:50:38,043 INFO L87 Difference]: Start difference. First operand 819 states and 1912 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 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-20 20:50:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:39,400 INFO L93 Difference]: Finished difference Result 1573 states and 3673 transitions. [2022-11-20 20:50:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:50:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 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-20 20:50:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:39,405 INFO L225 Difference]: With dead ends: 1573 [2022-11-20 20:50:39,406 INFO L226 Difference]: Without dead ends: 1573 [2022-11-20 20:50:39,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=803, Unknown=6, NotChecked=62, Total=1122 [2022-11-20 20:50:39,407 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 364 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:39,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 108 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 772 Invalid, 0 Unknown, 395 Unchecked, 0.8s Time] [2022-11-20 20:50:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-11-20 20:50:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 883. [2022-11-20 20:50:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 865 states have (on average 2.4416184971098267) internal successors, (2112), 882 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 2112 transitions. [2022-11-20 20:50:39,434 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 2112 transitions. Word has length 17 [2022-11-20 20:50:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:39,436 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 2112 transitions. [2022-11-20 20:50:39,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 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-20 20:50:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 2112 transitions. [2022-11-20 20:50:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:50:39,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:39,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:39,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 20:50:39,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 20:50:39,645 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1846649885, now seen corresponding path program 2 times [2022-11-20 20:50:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:39,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133044456] [2022-11-20 20:50:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:41,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-20 20:50:41,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133044456] [2022-11-20 20:50:41,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133044456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017870228] [2022-11-20 20:50:41,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:50:41,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:41,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:41,112 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:41,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:50:41,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:50:41,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:50:41,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:50:41,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:41,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:41,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:41,366 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:50:41,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:50:41,406 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:50:41,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:50:41,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:50:41,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2022-11-20 20:50:41,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 20:50:42,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:50:42,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:50:42,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:50:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:50:42,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:42,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:50:42,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_959)) |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_959 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:50:43,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_955 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_955))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_957) .cse1 v_ArrVal_959)) |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_959) (not (<= v_ArrVal_957 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:50:43,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_955 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_955))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_957) .cse1 v_ArrVal_959)) |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_959) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_957) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:50:43,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_955 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_953 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_953))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_955))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse2 v_ArrVal_957) .cse4 v_ArrVal_959)) |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_957) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_959))))))) is different from false [2022-11-20 20:50:43,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_955 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_160| Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_953 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_160| 4)) v_ArrVal_953))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_955))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_957) .cse1 v_ArrVal_959)) |c_~#stored_elements~0.base| v_ArrVal_960) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_160| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_959) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_957) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_962) .cse5) 2147483647)))))))) is different from false [2022-11-20 20:50:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:50:43,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017870228] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:50:43,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2087774301] [2022-11-20 20:50:43,293 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:50:43,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:50:43,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:50:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363074583] [2022-11-20 20:50:43,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:50:43,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:50:43,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:50:43,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:50:43,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=664, Unknown=13, NotChecked=366, Total=1260 [2022-11-20 20:50:43,297 INFO L87 Difference]: Start difference. First operand 883 states and 2112 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:54,866 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 40 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:50:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:50:55,401 INFO L93 Difference]: Finished difference Result 1238 states and 2948 transitions. [2022-11-20 20:50:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 20:50:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:50:55,406 INFO L225 Difference]: With dead ends: 1238 [2022-11-20 20:50:55,406 INFO L226 Difference]: Without dead ends: 1238 [2022-11-20 20:50:55,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=514, Invalid=1475, Unknown=15, NotChecked=546, Total=2550 [2022-11-20 20:50:55,407 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 149 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1412 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:50:55,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 158 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 1412 Unchecked, 0.4s Time] [2022-11-20 20:50:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-11-20 20:50:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 978. [2022-11-20 20:50:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 960 states have (on average 2.459375) internal successors, (2361), 977 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:50:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2361 transitions. [2022-11-20 20:50:55,434 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 2361 transitions. Word has length 17 [2022-11-20 20:50:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:50:55,435 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 2361 transitions. [2022-11-20 20:50:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:50:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 2361 transitions. [2022-11-20 20:50:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:50:55,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:50:55,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:50:55,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:50:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 20:50:55,646 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:50:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:50:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643676, now seen corresponding path program 3 times [2022-11-20 20:50:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:50:55,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452821693] [2022-11-20 20:50:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:50:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:50:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:50:56,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-20 20:50:56,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:50:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452821693] [2022-11-20 20:50:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452821693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:50:56,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430389103] [2022-11-20 20:50:56,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:50:56,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:50:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:50:56,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:50:56,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:50:56,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:50:56,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:50:56,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-20 20:50:56,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:50:56,568 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:50:56,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:50:56,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:50:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:56,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 20:50:56,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 20:50:56,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:50:56,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 20:50:56,980 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 20:50:56,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 20:50:57,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-20 20:50:57,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:50:57,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1048 (Array Int Int)) (v_ArrVal_1049 Int)) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1049) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_1049 2147483648) 0))) is different from false [2022-11-20 20:50:57,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:57,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-20 20:50:57,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:50:57,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2233 treesize of output 2187 [2022-11-20 20:50:57,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2650 treesize of output 2490 [2022-11-20 20:50:57,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2790 treesize of output 2734 [2022-11-20 20:51:12,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:51:12,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 20:51:12,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-20 20:51:12,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-20 20:51:12,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-11-20 20:51:12,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:51:12,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 354 treesize of output 334 [2022-11-20 20:51:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:12,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430389103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:51:12,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [321295368] [2022-11-20 20:51:12,589 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:51:12,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:51:12,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-20 20:51:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310059118] [2022-11-20 20:51:12,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:51:12,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:51:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:51:12,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:51:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=480, Unknown=12, NotChecked=46, Total=650 [2022-11-20 20:51:12,591 INFO L87 Difference]: Start difference. First operand 978 states and 2361 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 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-20 20:51:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:51:13,277 INFO L93 Difference]: Finished difference Result 1799 states and 4290 transitions. [2022-11-20 20:51:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:51:13,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 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-20 20:51:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:51:13,281 INFO L225 Difference]: With dead ends: 1799 [2022-11-20 20:51:13,281 INFO L226 Difference]: Without dead ends: 1799 [2022-11-20 20:51:13,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=653, Unknown=12, NotChecked=56, Total=930 [2022-11-20 20:51:13,282 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 591 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:51:13,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 39 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 300 Invalid, 0 Unknown, 260 Unchecked, 0.4s Time] [2022-11-20 20:51:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-11-20 20:51:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 802. [2022-11-20 20:51:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 786 states have (on average 2.404580152671756) internal successors, (1890), 801 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:51:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1890 transitions. [2022-11-20 20:51:13,308 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1890 transitions. Word has length 17 [2022-11-20 20:51:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:51:13,308 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1890 transitions. [2022-11-20 20:51:13,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 25 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-20 20:51:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1890 transitions. [2022-11-20 20:51:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:51:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:51:13,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:51:13,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:51:13,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:13,516 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:51:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:51:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643677, now seen corresponding path program 3 times [2022-11-20 20:51:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:51:13,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528420054] [2022-11-20 20:51:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:51:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:51:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:51:15,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-20 20:51:15,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:51:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528420054] [2022-11-20 20:51:15,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528420054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:51:15,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153689540] [2022-11-20 20:51:15,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:51:15,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:15,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:51:15,329 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:51:15,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:51:15,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:51:15,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:51:15,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 20:51:15,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:51:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:15,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:15,532 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:51:15,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:51:15,553 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:51:15,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:51:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:51:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:51:15,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 20:51:16,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:51:16,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:16,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:16,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:51:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:16,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:51:16,982 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1148) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:51:17,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1147))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1148) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:51:17,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 Int) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1146)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1147))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1148) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1146 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:51:17,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1146 Int) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1146)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1147))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1148) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1146))))))) is different from false [2022-11-20 20:51:17,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1144)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1146)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1147))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1148) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1146) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse4 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-20 20:51:17,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1152 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1147 (Array Int Int)) (v_ArrVal_1144 Int) (v_ArrVal_1146 Int) (v_ArrVal_1148 Int) (v_ArrVal_1150 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1144)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1146)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1147))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1148)) |c_~#stored_elements~0.base| v_ArrVal_1150) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1146) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1152) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse4 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1148)))))))) is different from false [2022-11-20 20:51:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:51:17,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153689540] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:51:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1642435666] [2022-11-20 20:51:17,252 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:51:17,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:51:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:51:17,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118464080] [2022-11-20 20:51:17,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:51:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:51:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:51:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:51:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=610, Unknown=15, NotChecked=354, Total=1190 [2022-11-20 20:51:17,254 INFO L87 Difference]: Start difference. First operand 802 states and 1890 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:20,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:51:20,218 INFO L93 Difference]: Finished difference Result 811 states and 1909 transitions. [2022-11-20 20:51:20,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:51:20,218 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:51:20,221 INFO L225 Difference]: With dead ends: 811 [2022-11-20 20:51:20,221 INFO L226 Difference]: Without dead ends: 811 [2022-11-20 20:51:20,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=321, Invalid=876, Unknown=17, NotChecked=426, Total=1640 [2022-11-20 20:51:20,222 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:51:20,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 281 Unchecked, 0.1s Time] [2022-11-20 20:51:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-11-20 20:51:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 810. [2022-11-20 20:51:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 794 states have (on average 2.40176322418136) internal successors, (1907), 809 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:51:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1907 transitions. [2022-11-20 20:51:20,241 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1907 transitions. Word has length 17 [2022-11-20 20:51:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:51:20,241 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 1907 transitions. [2022-11-20 20:51:20,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1907 transitions. [2022-11-20 20:51:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:51:20,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:51:20,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:51:20,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:51:20,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:20,454 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:51:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:51:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1967693045, now seen corresponding path program 4 times [2022-11-20 20:51:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:51:20,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399482205] [2022-11-20 20:51:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:51:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:51:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:51:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:21,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:51:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399482205] [2022-11-20 20:51:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399482205] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:51:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464425330] [2022-11-20 20:51:21,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:51:21,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:51:21,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:51:21,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:51:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:51:22,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:51:22,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:51:22,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:22,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:22,071 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:51:22,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:51:22,093 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:51:22,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:51:22,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:51:22,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:51:22,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 20:51:22,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:51:22,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:22,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:23,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:51:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:23,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:51:23,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 Int) (v_ArrVal_1253 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:51:23,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1253 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1252 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:51:23,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1250 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1250))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1252) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:51:23,730 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1248 Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1250 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1248)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1250))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1248 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1252) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:51:23,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1248 Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1250 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1248)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1250))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1252) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1248))))))) is different from false [2022-11-20 20:51:23,796 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1248 Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1247 Int) (v_ArrVal_1250 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1247)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1248)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1250))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1252) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1248) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-20 20:51:23,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (v_ArrVal_1248 Int) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1247 Int) (v_ArrVal_1250 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1247)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1248)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1250))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| 4)) v_ArrVal_1255) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1252) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_173| (select .cse0 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1248)))))))) is different from false [2022-11-20 20:51:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:51:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464425330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:51:23,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709152182] [2022-11-20 20:51:23,930 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:51:23,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:51:23,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:51:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396232972] [2022-11-20 20:51:23,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:51:23,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:51:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:51:23,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:51:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=571, Unknown=11, NotChecked=406, Total=1190 [2022-11-20 20:51:23,933 INFO L87 Difference]: Start difference. First operand 810 states and 1907 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:51:26,965 INFO L93 Difference]: Finished difference Result 918 states and 2158 transitions. [2022-11-20 20:51:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:51:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:51:26,968 INFO L225 Difference]: With dead ends: 918 [2022-11-20 20:51:26,968 INFO L226 Difference]: Without dead ends: 918 [2022-11-20 20:51:26,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=289, Invalid=782, Unknown=13, NotChecked=476, Total=1560 [2022-11-20 20:51:26,970 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:51:26,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 627 Unchecked, 0.3s Time] [2022-11-20 20:51:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-20 20:51:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 868. [2022-11-20 20:51:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 852 states have (on average 2.4190140845070425) internal successors, (2061), 867 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:51:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2061 transitions. [2022-11-20 20:51:26,989 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2061 transitions. Word has length 17 [2022-11-20 20:51:26,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:51:26,989 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 2061 transitions. [2022-11-20 20:51:26,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:51:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2061 transitions. [2022-11-20 20:51:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:51:26,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:51:26,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:51:27,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:51:27,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-20 20:51:27,202 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:51:27,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:51:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113847, now seen corresponding path program 5 times [2022-11-20 20:51:27,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:51:27,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123498907] [2022-11-20 20:51:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:51:27,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:51:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:51:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:28,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:51:28,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123498907] [2022-11-20 20:51:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123498907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:51:28,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131599969] [2022-11-20 20:51:28,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:51:28,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:28,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:51:28,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:51:28,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:51:28,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:51:28,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:51:28,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 20:51:28,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:51:28,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:28,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:28,989 INFO L321 Elim1Store]: treesize reduction 65, result has 27.8 percent of original size [2022-11-20 20:51:28,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 58 [2022-11-20 20:51:29,013 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:51:29,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 31 [2022-11-20 20:51:29,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:51:29,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:51:29,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:51:29,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:29,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:29,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:29,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:51:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:30,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:51:30,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1355) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1356) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:51:30,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1354) |c_~#stored_elements~0.base| v_ArrVal_1355) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1356) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:51:31,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1351 Int) (v_ArrVal_1353 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1351) .cse2 v_ArrVal_1353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1354) |c_~#stored_elements~0.base| v_ArrVal_1355) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1356) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1353) (not (<= v_ArrVal_1351 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-20 20:51:31,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1351 Int) (v_ArrVal_1353 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1351) .cse3 v_ArrVal_1353)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1354) |c_~#stored_elements~0.base| v_ArrVal_1355) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1356) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1351) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1353))))) is different from false [2022-11-20 20:51:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:51:39,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131599969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:51:39,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920301189] [2022-11-20 20:51:39,931 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:51:39,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:51:39,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:51:39,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066938752] [2022-11-20 20:51:39,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:51:39,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:51:39,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:51:39,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:51:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=766, Unknown=22, NotChecked=252, Total=1260 [2022-11-20 20:51:39,934 INFO L87 Difference]: Start difference. First operand 868 states and 2061 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:51:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:51:41,403 INFO L93 Difference]: Finished difference Result 885 states and 2097 transitions. [2022-11-20 20:51:41,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:51:41,403 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:51:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:51:41,406 INFO L225 Difference]: With dead ends: 885 [2022-11-20 20:51:41,406 INFO L226 Difference]: Without dead ends: 885 [2022-11-20 20:51:41,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=422, Invalid=1378, Unknown=22, NotChecked=340, Total=2162 [2022-11-20 20:51:41,407 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:51:41,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 75 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 565 Unchecked, 0.2s Time] [2022-11-20 20:51:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-20 20:51:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 868. [2022-11-20 20:51:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 852 states have (on average 2.4190140845070425) internal successors, (2061), 867 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:51:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2061 transitions. [2022-11-20 20:51:41,426 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2061 transitions. Word has length 17 [2022-11-20 20:51:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:51:41,426 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 2061 transitions. [2022-11-20 20:51:41,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:51:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2061 transitions. [2022-11-20 20:51:41,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:51:41,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:51:41,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:51:41,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:51:41,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 20:51:41,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:51:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:51:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 872076677, now seen corresponding path program 6 times [2022-11-20 20:51:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:51:41,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500589996] [2022-11-20 20:51:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:51:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:51:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:51:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:43,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:51:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500589996] [2022-11-20 20:51:43,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500589996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:51:43,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593023960] [2022-11-20 20:51:43,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:51:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:51:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:51:43,210 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:51:43,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:51:43,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:51:43,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:51:43,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:51:43,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:51:43,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:43,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:43,440 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:51:43,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:51:43,460 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:51:43,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:51:43,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:51:43,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:51:43,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:51:44,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:51:44,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:44,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:51:44,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:51:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:44,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:51:44,688 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (v_ArrVal_1458 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1458) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_1460) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:51:44,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1458) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_1460) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:51:44,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1460 Int) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1455 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1455)) |c_~#stored_elements~0.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1458) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_1460) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_183| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1455 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 20:51:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:51:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593023960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:51:59,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1033360905] [2022-11-20 20:51:59,534 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:51:59,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:51:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:51:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104828346] [2022-11-20 20:51:59,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:51:59,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:51:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:51:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:51:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=788, Unknown=39, NotChecked=192, Total=1260 [2022-11-20 20:51:59,536 INFO L87 Difference]: Start difference. First operand 868 states and 2061 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:52:03,409 INFO L93 Difference]: Finished difference Result 1164 states and 2725 transitions. [2022-11-20 20:52:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 20:52:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:52:03,411 INFO L225 Difference]: With dead ends: 1164 [2022-11-20 20:52:03,412 INFO L226 Difference]: Without dead ends: 1164 [2022-11-20 20:52:03,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=537, Invalid=1788, Unknown=39, NotChecked=288, Total=2652 [2022-11-20 20:52:03,413 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 184 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1321 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:52:03,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 186 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 405 Invalid, 0 Unknown, 1321 Unchecked, 0.4s Time] [2022-11-20 20:52:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-11-20 20:52:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 884. [2022-11-20 20:52:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 868 states have (on average 2.434331797235023) internal successors, (2113), 883 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:52:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2113 transitions. [2022-11-20 20:52:03,433 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2113 transitions. Word has length 17 [2022-11-20 20:52:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:52:03,433 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 2113 transitions. [2022-11-20 20:52:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2113 transitions. [2022-11-20 20:52:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:52:03,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:52:03,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:52:03,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:52:03,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:52:03,641 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:52:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:52:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash 872710937, now seen corresponding path program 7 times [2022-11-20 20:52:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:52:03,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91306058] [2022-11-20 20:52:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:52:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:52:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:52:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:52:04,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:52:04,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91306058] [2022-11-20 20:52:04,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91306058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:52:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009860441] [2022-11-20 20:52:04,965 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:52:04,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:52:04,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:52:04,966 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:52:04,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 20:52:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:52:05,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:52:05,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:52:05,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:52:05,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:52:05,188 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:52:05,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:52:05,207 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:52:05,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:52:05,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:52:05,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:52:05,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:52:05,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:52:05,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:52:06,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2022-11-20 20:52:06,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:52:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:52:06,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:52:06,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 Int) (v_ArrVal_1561 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1561) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1563) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-20 20:52:06,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| Int) (v_ArrVal_1563 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1560))) (or (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| 4)) v_ArrVal_1563) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:52:06,959 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| Int) (v_ArrVal_1563 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1559)) |c_~#stored_elements~0.base| v_ArrVal_1560))) (or (not (<= v_ArrVal_1559 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| 4)) v_ArrVal_1563) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:52:06,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| Int) (v_ArrVal_1563 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1559)) |c_~#stored_elements~0.base| v_ArrVal_1560))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1559) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (< (select (store (select (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| 4)) v_ArrVal_1563) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:52:07,161 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| Int) (v_ArrVal_1563 Int) (v_ArrVal_1556 Int) (v_ArrVal_1561 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (v_ArrVal_1559 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1556) .cse3 v_ArrVal_1559)) |c_~#stored_elements~0.base| v_ArrVal_1560))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1556) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1559) (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1561) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_188| 4)) v_ArrVal_1563) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:52:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:52:13,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009860441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:52:13,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1333286527] [2022-11-20 20:52:13,090 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:52:13,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:52:13,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:52:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084449796] [2022-11-20 20:52:13,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:52:13,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:52:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:52:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:52:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=753, Unknown=18, NotChecked=310, Total=1260 [2022-11-20 20:52:13,094 INFO L87 Difference]: Start difference. First operand 884 states and 2113 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:52:21,504 INFO L93 Difference]: Finished difference Result 1309 states and 3112 transitions. [2022-11-20 20:52:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 20:52:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:52:21,508 INFO L225 Difference]: With dead ends: 1309 [2022-11-20 20:52:21,509 INFO L226 Difference]: Without dead ends: 1309 [2022-11-20 20:52:21,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=434, Invalid=1543, Unknown=23, NotChecked=450, Total=2450 [2022-11-20 20:52:21,510 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 136 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 845 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:52:21,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 223 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 845 Unchecked, 0.4s Time] [2022-11-20 20:52:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2022-11-20 20:52:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 984. [2022-11-20 20:52:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 968 states have (on average 2.479338842975207) internal successors, (2400), 983 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:52:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 2400 transitions. [2022-11-20 20:52:21,554 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 2400 transitions. Word has length 17 [2022-11-20 20:52:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:52:21,554 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 2400 transitions. [2022-11-20 20:52:21,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:52:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2400 transitions. [2022-11-20 20:52:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:52:21,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:52:21,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:52:21,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:52:21,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:52:21,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:52:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:52:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 872614217, now seen corresponding path program 8 times [2022-11-20 20:52:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:52:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104830989] [2022-11-20 20:52:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:52:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:52:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:53:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:53:20,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:53:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104830989] [2022-11-20 20:53:20,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104830989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:53:20,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267811094] [2022-11-20 20:53:20,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:53:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:53:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:53:20,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:53:20,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 20:53:20,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:53:20,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:53:20,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-20 20:53:20,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:53:20,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:53:20,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:53:20,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 20:53:20,453 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-20 20:53:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-20 20:53:20,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:53:21,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:53:21,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:53:21,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:53:22,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:53:22,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 20:53:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:53:23,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:53:23,127 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1666) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-20 20:53:23,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1663))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1664)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1666) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:53:23,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1662)) |c_~#stored_elements~0.base| v_ArrVal_1663))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1664)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1666) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1662 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))) is different from false [2022-11-20 20:53:24,537 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1660) .cse3 v_ArrVal_1662)) |c_~#stored_elements~0.base| v_ArrVal_1663))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1664)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1666) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1662) (not (<= v_ArrVal_1660 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-20 20:53:25,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int) (v_ArrVal_1658 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1658)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1660) .cse2 v_ArrVal_1662)) |c_~#stored_elements~0.base| v_ArrVal_1663))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1662) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1660) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1664)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1666) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:53:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:53:32,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267811094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:53:32,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [589683043] [2022-11-20 20:53:32,490 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:53:32,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:53:32,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:53:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426655690] [2022-11-20 20:53:32,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:53:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:53:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:53:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:53:32,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=716, Unknown=28, NotChecked=310, Total=1260 [2022-11-20 20:53:32,494 INFO L87 Difference]: Start difference. First operand 984 states and 2400 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:54:15,108 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 130 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:54:37,701 WARN L233 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 201 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:54:51,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 20:54:58,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 20:55:10,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 20:55:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:11,998 INFO L93 Difference]: Finished difference Result 1565 states and 3696 transitions. [2022-11-20 20:55:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 20:55:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:55:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:12,004 INFO L225 Difference]: With dead ends: 1565 [2022-11-20 20:55:12,004 INFO L226 Difference]: Without dead ends: 1565 [2022-11-20 20:55:12,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 107.7s TimeCoverageRelationStatistics Valid=569, Invalid=2271, Unknown=42, NotChecked=540, Total=3422 [2022-11-20 20:55:12,006 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 367 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1545 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:12,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 188 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 339 Invalid, 0 Unknown, 1545 Unchecked, 11.2s Time] [2022-11-20 20:55:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-11-20 20:55:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1022. [2022-11-20 20:55:12,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1006 states have (on average 2.4711729622266403) internal successors, (2486), 1021 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2486 transitions. [2022-11-20 20:55:12,032 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2486 transitions. Word has length 17 [2022-11-20 20:55:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:12,032 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 2486 transitions. [2022-11-20 20:55:12,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:55:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2486 transitions. [2022-11-20 20:55:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:55:12,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:12,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:12,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:12,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 20:55:12,240 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:55:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash 916763177, now seen corresponding path program 9 times [2022-11-20 20:55:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:12,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138138344] [2022-11-20 20:55:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:13,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:13,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138138344] [2022-11-20 20:55:13,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138138344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:55:13,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900647241] [2022-11-20 20:55:13,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:55:13,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:13,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:13,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:13,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 20:55:13,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:55:13,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:55:13,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 20:55:13,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:13,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:13,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:13,402 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:55:13,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:55:13,423 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:13,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:55:13,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:55:13,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:55:14,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:55:14,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:14,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:14,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:14,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:55:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:14,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:14,786 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_198| Int) (v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1769 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1767) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_198| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_198| 4) |c_~#queue~0.offset|) v_ArrVal_1769) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:55:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:30,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900647241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:30,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [747602642] [2022-11-20 20:55:30,803 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:55:30,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:55:30,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-20 20:55:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162440644] [2022-11-20 20:55:30,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:30,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:55:30,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:55:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=930, Unknown=36, NotChecked=68, Total=1332 [2022-11-20 20:55:30,806 INFO L87 Difference]: Start difference. First operand 1022 states and 2486 transitions. Second operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-20 20:55:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:31,277 INFO L93 Difference]: Finished difference Result 1185 states and 2839 transitions. [2022-11-20 20:55:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:55:31,277 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-20 20:55:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:31,280 INFO L225 Difference]: With dead ends: 1185 [2022-11-20 20:55:31,280 INFO L226 Difference]: Without dead ends: 1185 [2022-11-20 20:55:31,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=377, Invalid=1073, Unknown=36, NotChecked=74, Total=1560 [2022-11-20 20:55:31,281 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 250 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1003 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:31,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 113 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 171 Invalid, 0 Unknown, 1003 Unchecked, 0.2s Time] [2022-11-20 20:55:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-11-20 20:55:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 812. [2022-11-20 20:55:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 796 states have (on average 2.4045226130653266) internal successors, (1914), 811 states have internal predecessors, (1914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1914 transitions. [2022-11-20 20:55:31,300 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1914 transitions. Word has length 17 [2022-11-20 20:55:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:31,301 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1914 transitions. [2022-11-20 20:55:31,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 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-20 20:55:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1914 transitions. [2022-11-20 20:55:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:55:31,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:31,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:31,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:31,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 20:55:31,519 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:55:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2024988377, now seen corresponding path program 10 times [2022-11-20 20:55:31,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:31,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616438881] [2022-11-20 20:55:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:32,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616438881] [2022-11-20 20:55:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616438881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:55:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993392967] [2022-11-20 20:55:32,840 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:55:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:32,842 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:32,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:55:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:33,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:55:33,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:33,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:33,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:33,077 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:55:33,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:55:33,098 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:33,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:55:33,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:55:33,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:55:33,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2022-11-20 20:55:33,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2022-11-20 20:55:33,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:33,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:34,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:55:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:34,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:34,393 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| Int) (v_ArrVal_1871 Int) (v_ArrVal_1870 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1870) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| 4)) v_ArrVal_1871) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:55:34,501 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| Int) (v_ArrVal_1871 Int) (v_ArrVal_1870 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1867))) (store .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1869))) |c_~#stored_elements~0.base| v_ArrVal_1870) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| 4)) v_ArrVal_1871) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1869 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 20:55:34,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| Int) (v_ArrVal_1871 Int) (v_ArrVal_1870 (Array Int Int))) (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1867))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0 v_ArrVal_1869))) |c_~#stored_elements~0.base| v_ArrVal_1870) |c_~#queue~0.base|))) (or (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 1) v_ArrVal_1869) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| 4)) v_ArrVal_1871) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:55:34,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| Int) (v_ArrVal_1871 Int) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1865 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse3 v_ArrVal_1865)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1867))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 v_ArrVal_1869))) |c_~#stored_elements~0.base| v_ArrVal_1870) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1869) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1865) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| 4)) v_ArrVal_1871) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:55:34,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1867 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| Int) (v_ArrVal_1871 Int) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1863 Int) (v_ArrVal_1865 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1863)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1865)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1867))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3 v_ArrVal_1869))) |c_~#stored_elements~0.base| v_ArrVal_1870) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1865) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_203| 4)) v_ArrVal_1871) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1869))))) is different from false [2022-11-20 20:55:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:55:39,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993392967] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [343505026] [2022-11-20 20:55:39,230 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:55:39,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:55:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:55:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312977694] [2022-11-20 20:55:39,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:39,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:55:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:55:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=687, Unknown=11, NotChecked=300, Total=1190 [2022-11-20 20:55:39,233 INFO L87 Difference]: Start difference. First operand 812 states and 1914 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:55:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:40,361 INFO L93 Difference]: Finished difference Result 1021 states and 2396 transitions. [2022-11-20 20:55:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:55:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:55:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:40,363 INFO L225 Difference]: With dead ends: 1021 [2022-11-20 20:55:40,363 INFO L226 Difference]: Without dead ends: 1021 [2022-11-20 20:55:40,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=323, Invalid=1018, Unknown=11, NotChecked=370, Total=1722 [2022-11-20 20:55:40,364 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 134 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 760 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:40,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 131 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 760 Unchecked, 0.3s Time] [2022-11-20 20:55:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-11-20 20:55:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 844. [2022-11-20 20:55:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 828 states have (on average 2.4214975845410627) internal successors, (2005), 843 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2005 transitions. [2022-11-20 20:55:40,383 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2005 transitions. Word has length 17 [2022-11-20 20:55:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:40,384 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 2005 transitions. [2022-11-20 20:55:40,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-20 20:55:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2005 transitions. [2022-11-20 20:55:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:55:40,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:40,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:40,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 20:55:40,592 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:55:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2095177921, now seen corresponding path program 11 times [2022-11-20 20:55:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558772554] [2022-11-20 20:55:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:41,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:41,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558772554] [2022-11-20 20:55:41,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558772554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:55:41,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878355874] [2022-11-20 20:55:41,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:55:41,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:41,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:41,743 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:41,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 20:55:41,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:55:41,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:55:41,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 20:55:41,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:42,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:42,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:42,024 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:55:42,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:55:42,046 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:42,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:55:42,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:55:42,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 20:55:42,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:55:42,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:55:42,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:42,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:42,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:55:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:43,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:43,241 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1972 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1973 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1972) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1973) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:55:43,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1969 Int) (v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1973 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1969) .cse1 v_ArrVal_1970)) |c_~#stored_elements~0.base| v_ArrVal_1972) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1970) (not (<= v_ArrVal_1969 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1973) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:55:44,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1969 Int) (v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1973 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1967))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1969) .cse3 v_ArrVal_1970)) |c_~#stored_elements~0.base| v_ArrVal_1972) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1969) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1970) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1973) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:55:44,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1969 Int) (v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1973 Int) (v_ArrVal_1965 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1965)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1967))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1969) .cse1 v_ArrVal_1970)) |c_~#stored_elements~0.base| v_ArrVal_1972) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1970) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1969) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1973) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse3 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:55:44,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1969 Int) (v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_1973 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| Int) (v_ArrVal_1965 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_1965)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1967))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_1969) .cse1 v_ArrVal_1970)) |c_~#stored_elements~0.base| v_ArrVal_1972) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1970) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_1973) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse3 .cse1))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1969))))))) is different from false [2022-11-20 20:55:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:55:44,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878355874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1461397384] [2022-11-20 20:55:44,547 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:55:44,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:55:44,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:55:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978196769] [2022-11-20 20:55:44,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:44,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:55:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:55:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=685, Unknown=16, NotChecked=310, Total=1260 [2022-11-20 20:55:44,550 INFO L87 Difference]: Start difference. First operand 844 states and 2005 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:55:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:48,107 INFO L93 Difference]: Finished difference Result 1359 states and 3196 transitions. [2022-11-20 20:55:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 20:55:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:55:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:48,109 INFO L225 Difference]: With dead ends: 1359 [2022-11-20 20:55:48,110 INFO L226 Difference]: Without dead ends: 1359 [2022-11-20 20:55:48,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=415, Invalid=1229, Unknown=16, NotChecked=410, Total=2070 [2022-11-20 20:55:48,112 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 203 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1282 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:48,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 171 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 386 Invalid, 0 Unknown, 1282 Unchecked, 0.4s Time] [2022-11-20 20:55:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-20 20:55:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 901. [2022-11-20 20:55:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 885 states have (on average 2.4519774011299433) internal successors, (2170), 900 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:48,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2170 transitions. [2022-11-20 20:55:48,133 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2170 transitions. Word has length 17 [2022-11-20 20:55:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:48,133 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 2170 transitions. [2022-11-20 20:55:48,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-20 20:55:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2170 transitions. [2022-11-20 20:55:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:55:48,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:48,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:48,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:48,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 20:55:48,341 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:55:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1404691294, now seen corresponding path program 1 times [2022-11-20 20:55:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029976285] [2022-11-20 20:55:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:49,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029976285] [2022-11-20 20:55:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029976285] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:55:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234457488] [2022-11-20 20:55:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:49,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:49,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:49,383 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:49,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 20:55:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:49,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 20:55:49,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:49,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:49,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:49,628 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:55:49,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:55:49,651 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:49,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:55:49,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:55:49,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2022-11-20 20:55:50,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 20:55:50,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:55:50,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:50,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:50,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:55:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:50,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:53,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| Int) (v_ArrVal_2075 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2073) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|) v_ArrVal_2076) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:55:53,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2076 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2071) .cse3 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|) v_ArrVal_2076) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_2073) (not (<= v_ArrVal_2071 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-20 20:55:53,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2076 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2070))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2071) .cse3 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse3))) (or (not (<= v_ArrVal_2071 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (= 400 .cse1) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|) v_ArrVal_2076) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_2073)))))) is different from false [2022-11-20 20:55:53,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2076 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| Int) (v_ArrVal_2068 Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2068))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2070))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse3 v_ArrVal_2071) .cse6 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075) |c_~#queue~0.base|))) (or (= .cse0 400) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|) v_ArrVal_2076) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2071) (< (+ .cse0 1) v_ArrVal_2073) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-20 20:55:53,557 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2076 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (v_ArrVal_2068 Int) (v_ArrVal_2075 (Array Int Int)) (v_ArrVal_2071 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2068))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2070))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse7 .cse4)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_2071) .cse4 v_ArrVal_2073)) |c_~#stored_elements~0.base| v_ArrVal_2075) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2071) (< (+ .cse2 1) v_ArrVal_2073) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| (select .cse5 .cse4))) (= 400 .cse2) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_213| 4) |c_~#queue~0.offset|) v_ArrVal_2076) .cse1) 2147483647)))))))) is different from false [2022-11-20 20:55:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:55:53,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234457488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [472216642] [2022-11-20 20:55:53,666 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:55:53,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:55:53,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-20 20:55:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194766472] [2022-11-20 20:55:53,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:55:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:55:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:55:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=753, Unknown=18, NotChecked=320, Total=1332 [2022-11-20 20:55:53,669 INFO L87 Difference]: Start difference. First operand 901 states and 2170 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:56,487 INFO L93 Difference]: Finished difference Result 1123 states and 2685 transitions. [2022-11-20 20:55:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:55:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:55:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:56,491 INFO L225 Difference]: With dead ends: 1123 [2022-11-20 20:55:56,492 INFO L226 Difference]: Without dead ends: 1123 [2022-11-20 20:55:56,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=317, Invalid=945, Unknown=18, NotChecked=360, Total=1640 [2022-11-20 20:55:56,493 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:56,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 156 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 864 Unchecked, 0.3s Time] [2022-11-20 20:55:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-11-20 20:55:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 863. [2022-11-20 20:55:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 847 states have (on average 2.4427390791027155) internal successors, (2069), 862 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 2069 transitions. [2022-11-20 20:55:56,512 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 2069 transitions. Word has length 18 [2022-11-20 20:55:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:56,512 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 2069 transitions. [2022-11-20 20:55:56,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 2069 transitions. [2022-11-20 20:55:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:55:56,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:56,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:56,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:56,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 20:55:56,718 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:55:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:56,719 INFO L85 PathProgramCache]: Analyzing trace with hash 760375266, now seen corresponding path program 2 times [2022-11-20 20:55:56,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:55:56,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434352336] [2022-11-20 20:55:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:55:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:58,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:55:58,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434352336] [2022-11-20 20:55:58,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434352336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:55:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343049696] [2022-11-20 20:55:58,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:55:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:58,356 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:58,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 20:55:58,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:55:58,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:55:58,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:55:58,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:58,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:58,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:58,630 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:55:58,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:55:58,649 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:55:58,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:55:58,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:55:58,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:55:59,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 20:55:59,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:55:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:55:59,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:55:59,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:55:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:59,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:00,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_2176 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:00,572 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2175 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2176) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:56:00,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2175 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2173)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2176) (not (<= v_ArrVal_2173 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 20:56:00,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2175 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2173)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2176) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2173) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-20 20:56:00,672 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2171 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2171)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2173)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2176) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2173) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-20 20:56:00,704 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2173 Int) (v_ArrVal_2176 Int) (v_ArrVal_2179 Int) (v_ArrVal_2178 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_219| Int) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2171 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_219| 4) |c_~#queue~0.offset|) v_ArrVal_2171)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_2173)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2175))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_2176)) |c_~#stored_elements~0.base| v_ArrVal_2178) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_219| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2173) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2179) .cse3) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2176) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_218| (select .cse4 .cse1)))))))))) is different from false [2022-11-20 20:56:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:56:00,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343049696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:00,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [484573778] [2022-11-20 20:56:00,793 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:00,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:00,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:56:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445565789] [2022-11-20 20:56:00,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:00,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:56:00,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:56:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=641, Unknown=15, NotChecked=366, Total=1260 [2022-11-20 20:56:00,795 INFO L87 Difference]: Start difference. First operand 863 states and 2069 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:04,616 INFO L93 Difference]: Finished difference Result 1239 states and 2939 transitions. [2022-11-20 20:56:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:56:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:04,618 INFO L225 Difference]: With dead ends: 1239 [2022-11-20 20:56:04,619 INFO L226 Difference]: Without dead ends: 1239 [2022-11-20 20:56:04,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=446, Invalid=1198, Unknown=20, NotChecked=498, Total=2162 [2022-11-20 20:56:04,620 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 219 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1528 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:04,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 161 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 305 Invalid, 0 Unknown, 1528 Unchecked, 0.3s Time] [2022-11-20 20:56:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-11-20 20:56:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 857. [2022-11-20 20:56:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 841 states have (on average 2.4387633769322234) internal successors, (2051), 856 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2051 transitions. [2022-11-20 20:56:04,634 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2051 transitions. Word has length 18 [2022-11-20 20:56:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:04,635 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 2051 transitions. [2022-11-20 20:56:04,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2051 transitions. [2022-11-20 20:56:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:04,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:04,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:04,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-20 20:56:04,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:04,836 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash -868946124, now seen corresponding path program 3 times [2022-11-20 20:56:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274214887] [2022-11-20 20:56:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:06,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:06,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274214887] [2022-11-20 20:56:06,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274214887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:06,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374523356] [2022-11-20 20:56:06,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:56:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:06,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:06,088 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:06,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 20:56:06,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:56:06,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:06,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:56:06,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:06,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:06,348 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:56:06,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:56:06,371 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:56:06,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:56:06,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:06,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:06,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 20:56:07,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:07,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:07,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:56:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:07,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:07,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:07,664 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (v_ArrVal_2279 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2279 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:07,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2278))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2279)))))) is different from false [2022-11-20 20:56:07,831 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (v_ArrVal_2276 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2276)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2278))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2279) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_2276 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:56:07,870 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (v_ArrVal_2276 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2276)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2278))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2279) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2276))))))) is different from false [2022-11-20 20:56:07,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (v_ArrVal_2276 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (v_ArrVal_2275 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2275)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2276)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2278))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2276) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_2279))))))) is different from false [2022-11-20 20:56:07,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2281 (Array Int Int)) (v_ArrVal_2283 Int) (v_ArrVal_2276 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| Int) (v_ArrVal_2275 Int) (v_ArrVal_2278 (Array Int Int)) (v_ArrVal_2279 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| 4) |c_~#queue~0.offset|) v_ArrVal_2275)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse2 v_ArrVal_2276)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2278))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_2279)) |c_~#stored_elements~0.base| v_ArrVal_2281) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_2283) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2279) (< (+ (select .cse4 .cse2) 1) v_ArrVal_2276) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_224| (select .cse5 .cse1)))))))))) is different from false [2022-11-20 20:56:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:56:08,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374523356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:08,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [264016691] [2022-11-20 20:56:08,075 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:08,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:08,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:56:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315488287] [2022-11-20 20:56:08,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:08,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:56:08,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:56:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=598, Unknown=8, NotChecked=420, Total=1260 [2022-11-20 20:56:08,078 INFO L87 Difference]: Start difference. First operand 857 states and 2051 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:09,138 INFO L93 Difference]: Finished difference Result 1209 states and 2883 transitions. [2022-11-20 20:56:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:56:09,138 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:09,140 INFO L225 Difference]: With dead ends: 1209 [2022-11-20 20:56:09,140 INFO L226 Difference]: Without dead ends: 1209 [2022-11-20 20:56:09,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=312, Invalid=830, Unknown=8, NotChecked=490, Total=1640 [2022-11-20 20:56:09,141 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 137 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:09,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 137 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 1118 Unchecked, 0.3s Time] [2022-11-20 20:56:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2022-11-20 20:56:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 857. [2022-11-20 20:56:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 841 states have (on average 2.4447086801426874) internal successors, (2056), 856 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 2056 transitions. [2022-11-20 20:56:09,161 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 2056 transitions. Word has length 18 [2022-11-20 20:56:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:09,162 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 2056 transitions. [2022-11-20 20:56:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 2056 transitions. [2022-11-20 20:56:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:09,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:09,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:09,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:09,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:09,375 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1789787016, now seen corresponding path program 4 times [2022-11-20 20:56:09,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:09,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486174436] [2022-11-20 20:56:09,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:10,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486174436] [2022-11-20 20:56:10,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486174436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723924584] [2022-11-20 20:56:10,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:56:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:10,235 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:10,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 20:56:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:10,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 20:56:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:10,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:10,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:10,490 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:56:10,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:56:10,511 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:56:10,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:56:10,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:10,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:11,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:11,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:11,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:11,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:11,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:56:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:11,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:11,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2385 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| Int) (v_ArrVal_2384 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2384) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| 4) |c_~#queue~0.offset|) v_ArrVal_2385) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:56:11,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2385 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| Int) (v_ArrVal_2384 (Array Int Int)) (v_ArrVal_2383 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2383) |c_~#stored_elements~0.base| v_ArrVal_2384) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_228| 4) |c_~#queue~0.offset|) v_ArrVal_2385) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:56:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:25,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723924584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [647143594] [2022-11-20 20:56:25,200 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:25,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:25,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-20 20:56:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362621464] [2022-11-20 20:56:25,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:25,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:56:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:56:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=889, Unknown=26, NotChecked=134, Total=1332 [2022-11-20 20:56:25,204 INFO L87 Difference]: Start difference. First operand 857 states and 2056 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:26,337 INFO L93 Difference]: Finished difference Result 963 states and 2297 transitions. [2022-11-20 20:56:26,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 20:56:26,337 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:26,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:26,339 INFO L225 Difference]: With dead ends: 963 [2022-11-20 20:56:26,339 INFO L226 Difference]: Without dead ends: 963 [2022-11-20 20:56:26,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=476, Invalid=1398, Unknown=26, NotChecked=170, Total=2070 [2022-11-20 20:56:26,341 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:26,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 712 Unchecked, 0.3s Time] [2022-11-20 20:56:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-11-20 20:56:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 859. [2022-11-20 20:56:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 843 states have (on average 2.4448398576512456) internal successors, (2061), 858 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2061 transitions. [2022-11-20 20:56:26,470 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2061 transitions. Word has length 18 [2022-11-20 20:56:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:26,470 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2061 transitions. [2022-11-20 20:56:26,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2061 transitions. [2022-11-20 20:56:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:26,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:26,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:26,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:26,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-20 20:56:26,682 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1789685646, now seen corresponding path program 5 times [2022-11-20 20:56:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131039685] [2022-11-20 20:56:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:27,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:27,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131039685] [2022-11-20 20:56:27,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131039685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:27,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357345358] [2022-11-20 20:56:27,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:56:27,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:27,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:27,920 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:27,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 20:56:28,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:56:28,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:28,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-20 20:56:28,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:28,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:28,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:28,231 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:56:28,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:56:28,264 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-20 20:56:28,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:56:28,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:28,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:28,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:28,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:29,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:29,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:56:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:29,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:29,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2487 Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2485) |c_~#stored_elements~0.base| v_ArrVal_2486) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2487) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:56:29,726 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2484 Int) (v_ArrVal_2487 Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2484)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2485) |c_~#stored_elements~0.base| v_ArrVal_2486) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2484 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2487) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:56:29,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2484 Int) (v_ArrVal_2487 Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2484)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2485) |c_~#stored_elements~0.base| v_ArrVal_2486) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2484) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2487) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:56:30,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2484 Int) (v_ArrVal_2487 Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_2482) .cse1 v_ArrVal_2484)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2485) |c_~#stored_elements~0.base| v_ArrVal_2486) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2484) (< (+ (select .cse0 .cse2) 1) v_ArrVal_2482) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2487) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:56:30,108 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2484 Int) (v_ArrVal_2487 Int) (v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2479 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2479)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_2482) .cse2 v_ArrVal_2484)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2485) |c_~#stored_elements~0.base| v_ArrVal_2486) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2487) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_2484) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2482))))) is different from false [2022-11-20 20:56:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:56:34,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357345358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:34,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915477081] [2022-11-20 20:56:34,772 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:34,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-20 20:56:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702783593] [2022-11-20 20:56:34,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:56:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:56:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=763, Unknown=13, NotChecked=320, Total=1332 [2022-11-20 20:56:34,775 INFO L87 Difference]: Start difference. First operand 859 states and 2061 transitions. Second operand has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:36,589 INFO L93 Difference]: Finished difference Result 868 states and 2087 transitions. [2022-11-20 20:56:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:56:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:36,591 INFO L225 Difference]: With dead ends: 868 [2022-11-20 20:56:36,591 INFO L226 Difference]: Without dead ends: 868 [2022-11-20 20:56:36,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=384, Invalid=1181, Unknown=15, NotChecked=400, Total=1980 [2022-11-20 20:56:36,592 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:36,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 520 Unchecked, 0.2s Time] [2022-11-20 20:56:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-20 20:56:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 859. [2022-11-20 20:56:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 843 states have (on average 2.4448398576512456) internal successors, (2061), 858 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2061 transitions. [2022-11-20 20:56:36,606 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2061 transitions. Word has length 18 [2022-11-20 20:56:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:36,606 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2061 transitions. [2022-11-20 20:56:36,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2061 transitions. [2022-11-20 20:56:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:36,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:36,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:36,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-20 20:56:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 20:56:36,819 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:36,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1782910596, now seen corresponding path program 6 times [2022-11-20 20:56:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:36,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108340468] [2022-11-20 20:56:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:37,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:37,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108340468] [2022-11-20 20:56:37,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108340468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:37,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606837701] [2022-11-20 20:56:37,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:56:37,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:37,585 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:37,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 20:56:37,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:56:37,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:37,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:56:37,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:37,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:37,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:37,853 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:56:37,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:56:37,873 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:56:37,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:56:38,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:38,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:38,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:38,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:38,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:38,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:56:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:38,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:39,017 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2589) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| 4)) v_ArrVal_2591) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:39,288 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2586 Int) (v_ArrVal_2588 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2586)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2588) |c_~#stored_elements~0.base| v_ArrVal_2589) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2586) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| 4)) v_ArrVal_2591) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:56:41,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2586 Int) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2585 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2585) .cse1 v_ArrVal_2586)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2588) |c_~#stored_elements~0.base| v_ArrVal_2589) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2586) (not (<= v_ArrVal_2585 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| 4)) v_ArrVal_2591) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:56:41,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2586 Int) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2585 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_2585) .cse1 v_ArrVal_2586)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2588) |c_~#stored_elements~0.base| v_ArrVal_2589) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2586) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_2585) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| 4)) v_ArrVal_2591) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:56:41,421 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2591 Int) (v_ArrVal_2583 Int) (v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2586 Int) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2585 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2583)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_2585) .cse1 v_ArrVal_2586)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2588) |c_~#stored_elements~0.base| v_ArrVal_2589) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2586) (< (+ 1 (select .cse0 .cse2)) v_ArrVal_2585) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_238| 4)) v_ArrVal_2591) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:56:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:56:46,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606837701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:46,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1191548115] [2022-11-20 20:56:46,222 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:46,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:46,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:56:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677822079] [2022-11-20 20:56:46,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:46,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:56:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:56:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=678, Unknown=22, NotChecked=310, Total=1260 [2022-11-20 20:56:46,225 INFO L87 Difference]: Start difference. First operand 859 states and 2061 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:47,034 INFO L93 Difference]: Finished difference Result 874 states and 2112 transitions. [2022-11-20 20:56:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:56:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:47,036 INFO L225 Difference]: With dead ends: 874 [2022-11-20 20:56:47,036 INFO L226 Difference]: Without dead ends: 874 [2022-11-20 20:56:47,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=365, Invalid=965, Unknown=22, NotChecked=370, Total=1722 [2022-11-20 20:56:47,037 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:47,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 155 Invalid, 0 Unknown, 586 Unchecked, 0.1s Time] [2022-11-20 20:56:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-11-20 20:56:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2022-11-20 20:56:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 843 states have (on average 2.4448398576512456) internal successors, (2061), 858 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2061 transitions. [2022-11-20 20:56:47,054 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2061 transitions. Word has length 18 [2022-11-20 20:56:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:47,054 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2061 transitions. [2022-11-20 20:56:47,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2061 transitions. [2022-11-20 20:56:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:47,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:47,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:47,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:47,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 20:56:47,262 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:47,262 INFO L85 PathProgramCache]: Analyzing trace with hash 280251382, now seen corresponding path program 7 times [2022-11-20 20:56:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:47,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153548484] [2022-11-20 20:56:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:48,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153548484] [2022-11-20 20:56:48,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153548484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:48,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251899673] [2022-11-20 20:56:48,534 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:56:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:48,535 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:48,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 20:56:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:48,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 20:56:48,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:48,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:48,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:48,810 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:56:48,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:56:48,833 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:56:48,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:56:48,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:49,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:49,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:49,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:49,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:49,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:49,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:56:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:50,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:50,185 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2692 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:50,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2692 (Array Int Int)) (v_ArrVal_2691 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2691) |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:50,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2689 Int) (v_ArrVal_2692 (Array Int Int)) (v_ArrVal_2691 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2689)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2691) |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_2689 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:56:50,250 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2689 Int) (v_ArrVal_2692 (Array Int Int)) (v_ArrVal_2691 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2689)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2691) |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2689) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:56:50,274 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2689 Int) (v_ArrVal_2692 (Array Int Int)) (v_ArrVal_2691 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2689)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2691) |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse1 1) v_ArrVal_2689) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) (= 400 .cse1)))) is different from false [2022-11-20 20:56:50,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| Int) (v_ArrVal_2694 Int) (v_ArrVal_2687 Int) (v_ArrVal_2686 Int) (v_ArrVal_2689 Int) (v_ArrVal_2692 (Array Int Int)) (v_ArrVal_2691 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2686)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_2687) .cse4 v_ArrVal_2689)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2691) |c_~#stored_elements~0.base| v_ArrVal_2692) |c_~#queue~0.base|)) (.cse3 (select .cse1 .cse4))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| 4) |c_~#queue~0.offset|) v_ArrVal_2694) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_243| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2687) (< (+ .cse3 1) v_ArrVal_2689) (= 400 .cse3))))) is different from false [2022-11-20 20:56:55,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:56:55,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251899673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:55,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038460592] [2022-11-20 20:56:55,169 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:56:55,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:56:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2022-11-20 20:56:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847861740] [2022-11-20 20:56:55,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:55,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:56:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:56:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=659, Unknown=11, NotChecked=366, Total=1260 [2022-11-20 20:56:55,173 INFO L87 Difference]: Start difference. First operand 859 states and 2061 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:56,534 INFO L93 Difference]: Finished difference Result 891 states and 2164 transitions. [2022-11-20 20:56:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 20:56:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:56:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:56,536 INFO L225 Difference]: With dead ends: 891 [2022-11-20 20:56:56,536 INFO L226 Difference]: Without dead ends: 891 [2022-11-20 20:56:56,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=420, Invalid=1233, Unknown=11, NotChecked=498, Total=2162 [2022-11-20 20:56:56,536 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:56,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 75 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 479 Unchecked, 0.1s Time] [2022-11-20 20:56:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-11-20 20:56:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 859. [2022-11-20 20:56:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 843 states have (on average 2.4448398576512456) internal successors, (2061), 858 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 2061 transitions. [2022-11-20 20:56:56,554 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 2061 transitions. Word has length 18 [2022-11-20 20:56:56,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:56,555 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 2061 transitions. [2022-11-20 20:56:56,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 2061 transitions. [2022-11-20 20:56:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:56:56,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:56,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:56,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:56,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:56,768 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:56:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1264569338, now seen corresponding path program 8 times [2022-11-20 20:56:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:56:56,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971678519] [2022-11-20 20:56:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:56:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:57,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:57,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971678519] [2022-11-20 20:56:57,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971678519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:56:57,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875238379] [2022-11-20 20:56:57,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:56:57,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:57,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:57,633 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:57,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 20:56:57,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:56:57,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:57,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-20 20:56:57,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:57,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:56:57,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 20:56:57,988 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-20 20:56:57,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-20 20:56:58,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:56:58,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:56:58,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:56:58,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:58,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:56:59,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:57:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:00,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:00,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| Int) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2796 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2795) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| 4)) v_ArrVal_2796) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:57:00,670 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| Int) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2794) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2795) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| 4)) v_ArrVal_2796) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:57:00,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2793 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| Int) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2796 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2793)) |c_~#stored_elements~0.base| v_ArrVal_2794) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2795) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_248| 4)) v_ArrVal_2796) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2793))))) is different from false [2022-11-20 20:57:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:09,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875238379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:09,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387562063] [2022-11-20 20:57:09,364 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:57:09,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:57:09,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:57:09,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644922299] [2022-11-20 20:57:09,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:57:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:57:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=789, Unknown=25, NotChecked=192, Total=1260 [2022-11-20 20:57:09,366 INFO L87 Difference]: Start difference. First operand 859 states and 2061 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:09,858 INFO L93 Difference]: Finished difference Result 869 states and 2089 transitions. [2022-11-20 20:57:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:57:09,858 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:57:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:09,860 INFO L225 Difference]: With dead ends: 869 [2022-11-20 20:57:09,860 INFO L226 Difference]: Without dead ends: 869 [2022-11-20 20:57:09,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=328, Invalid=919, Unknown=25, NotChecked=210, Total=1482 [2022-11-20 20:57:09,860 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:09,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 467 Unchecked, 0.1s Time] [2022-11-20 20:57:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-11-20 20:57:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 861. [2022-11-20 20:57:09,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 845 states have (on average 2.4437869822485205) internal successors, (2065), 860 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2065 transitions. [2022-11-20 20:57:09,872 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 2065 transitions. Word has length 18 [2022-11-20 20:57:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:09,872 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 2065 transitions. [2022-11-20 20:57:09,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2065 transitions. [2022-11-20 20:57:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:57:09,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:09,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:09,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:10,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 20:57:10,074 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:57:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:10,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1264467968, now seen corresponding path program 9 times [2022-11-20 20:57:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:10,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246679268] [2022-11-20 20:57:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:11,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246679268] [2022-11-20 20:57:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246679268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108081058] [2022-11-20 20:57:11,315 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:57:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:11,317 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:11,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 20:57:11,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:57:11,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:57:11,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:57:11,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:11,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:11,604 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:57:11,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:57:11,624 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:57:11,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:57:11,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:57:11,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:57:12,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:57:12,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:12,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:12,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:12,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:57:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:12,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:13,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| Int) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2900 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2898) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| 4)) v_ArrVal_2900) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:57:13,477 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| Int) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2900 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2894) .cse2 v_ArrVal_2896)) |c_~#stored_elements~0.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2898) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_2894 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| 4)) v_ArrVal_2900) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2896))))) is different from false [2022-11-20 20:57:13,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| Int) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2900 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_2894) .cse3 v_ArrVal_2896)) |c_~#stored_elements~0.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2898) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2894) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| 4)) v_ArrVal_2900) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2896))))) is different from false [2022-11-20 20:57:13,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| Int) (v_ArrVal_2892 Int) (v_ArrVal_2898 (Array Int Int)) (v_ArrVal_2897 (Array Int Int)) (v_ArrVal_2894 Int) (v_ArrVal_2896 Int) (v_ArrVal_2900 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2892)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_2894) .cse3 v_ArrVal_2896)) |c_~#stored_elements~0.base| v_ArrVal_2897) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2898) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_253| 4)) v_ArrVal_2900) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2894) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2896))))) is different from false [2022-11-20 20:57:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:57:20,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108081058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:20,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602417221] [2022-11-20 20:57:20,236 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:57:20,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:57:20,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:57:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617284348] [2022-11-20 20:57:20,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:20,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:57:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:20,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:57:20,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=744, Unknown=23, NotChecked=252, Total=1260 [2022-11-20 20:57:20,239 INFO L87 Difference]: Start difference. First operand 861 states and 2065 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:21,428 INFO L93 Difference]: Finished difference Result 880 states and 2116 transitions. [2022-11-20 20:57:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:57:21,429 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:57:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:21,430 INFO L225 Difference]: With dead ends: 880 [2022-11-20 20:57:21,430 INFO L226 Difference]: Without dead ends: 880 [2022-11-20 20:57:21,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=420, Invalid=1295, Unknown=23, NotChecked=332, Total=2070 [2022-11-20 20:57:21,431 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 475 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:21,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 75 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 475 Unchecked, 0.2s Time] [2022-11-20 20:57:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-11-20 20:57:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 861. [2022-11-20 20:57:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 845 states have (on average 2.4437869822485205) internal successors, (2065), 860 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2065 transitions. [2022-11-20 20:57:21,440 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 2065 transitions. Word has length 18 [2022-11-20 20:57:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:21,440 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 2065 transitions. [2022-11-20 20:57:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2065 transitions. [2022-11-20 20:57:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:57:21,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:21,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:21,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:21,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 20:57:21,642 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:57:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1257692918, now seen corresponding path program 10 times [2022-11-20 20:57:21,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:21,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040653888] [2022-11-20 20:57:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:22,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040653888] [2022-11-20 20:57:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040653888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373411581] [2022-11-20 20:57:22,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:57:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:22,972 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:22,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 20:57:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:23,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 20:57:23,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:23,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:23,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:23,256 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:57:23,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:57:23,278 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:57:23,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:57:23,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:57:23,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:57:23,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:57:23,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:23,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:24,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:24,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:57:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:24,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:24,604 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| Int) (v_ArrVal_3002 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3000) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| 4)) v_ArrVal_3002) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:57:24,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| Int) (v_ArrVal_3002 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2999) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3000) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| 4)) v_ArrVal_3002) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:57:25,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2999 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| Int) (v_ArrVal_2995 Int) (v_ArrVal_2994 Int) (v_ArrVal_2997 Int) (v_ArrVal_3002 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2994)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2995) .cse3 v_ArrVal_2997)) |c_~#stored_elements~0.base| v_ArrVal_2999) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3000) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2995) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| 4)) v_ArrVal_3002) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_2997) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_258| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:57:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:57:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373411581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1749106270] [2022-11-20 20:57:32,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-20 20:57:32,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:57:32,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:57:32,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808512395] [2022-11-20 20:57:32,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:57:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:32,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:57:32,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=797, Unknown=30, NotChecked=192, Total=1260 [2022-11-20 20:57:32,161 INFO L87 Difference]: Start difference. First operand 861 states and 2065 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:33,431 INFO L93 Difference]: Finished difference Result 906 states and 2214 transitions. [2022-11-20 20:57:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 20:57:33,432 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:57:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:33,433 INFO L225 Difference]: With dead ends: 906 [2022-11-20 20:57:33,433 INFO L226 Difference]: Without dead ends: 906 [2022-11-20 20:57:33,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=413, Invalid=1375, Unknown=30, NotChecked=252, Total=2070 [2022-11-20 20:57:33,434 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:33,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 238 Invalid, 0 Unknown, 566 Unchecked, 0.2s Time] [2022-11-20 20:57:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-20 20:57:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 861. [2022-11-20 20:57:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 845 states have (on average 2.4437869822485205) internal successors, (2065), 860 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 2065 transitions. [2022-11-20 20:57:33,443 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 2065 transitions. Word has length 18 [2022-11-20 20:57:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:33,443 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 2065 transitions. [2022-11-20 20:57:33,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 2065 transitions. [2022-11-20 20:57:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:57:33,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:33,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:33,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:33,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 20:57:33,652 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:57:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1284231398, now seen corresponding path program 11 times [2022-11-20 20:57:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367757522] [2022-11-20 20:57:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:34,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:34,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367757522] [2022-11-20 20:57:34,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367757522] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:34,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690640008] [2022-11-20 20:57:34,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:57:34,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:34,526 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:34,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 20:57:34,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:57:34,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:57:34,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:57:34,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:34,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:34,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:34,874 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:57:34,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:57:34,899 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:57:34,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:57:35,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:57:35,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:57:35,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:57:35,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:35,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:35,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2022-11-20 20:57:35,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:57:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:36,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:36,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3104 Int) (v_ArrVal_3103 (Array Int Int))) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3103) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3104) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-20 20:57:36,377 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| Int) (v_ArrVal_3102 (Array Int Int)) (v_ArrVal_3104 Int) (v_ArrVal_3103 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3102))) (or (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3103) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| 4)) v_ArrVal_3104) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:57:36,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| Int) (v_ArrVal_3102 (Array Int Int)) (v_ArrVal_3104 Int) (v_ArrVal_3103 (Array Int Int)) (v_ArrVal_3101 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3101)) |c_~#stored_elements~0.base| v_ArrVal_3102))) (or (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3103) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| 4)) v_ArrVal_3104) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_263| (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3101))))) is different from false [2022-11-20 20:57:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:45,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690640008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1622237955] [2022-11-20 20:57:45,069 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:57:45,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:57:45,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:57:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092716962] [2022-11-20 20:57:45,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:57:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:57:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:57:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=751, Unknown=25, NotChecked=186, Total=1190 [2022-11-20 20:57:45,071 INFO L87 Difference]: Start difference. First operand 861 states and 2065 transitions. Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:50,118 INFO L93 Difference]: Finished difference Result 1200 states and 2829 transitions. [2022-11-20 20:57:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:57:50,118 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:57:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:50,120 INFO L225 Difference]: With dead ends: 1200 [2022-11-20 20:57:50,120 INFO L226 Difference]: Without dead ends: 1200 [2022-11-20 20:57:50,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=281, Invalid=962, Unknown=29, NotChecked=210, Total=1482 [2022-11-20 20:57:50,120 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 251 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1895 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:50,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 168 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 322 Invalid, 0 Unknown, 1895 Unchecked, 0.3s Time] [2022-11-20 20:57:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-11-20 20:57:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 860. [2022-11-20 20:57:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 844 states have (on average 2.4443127962085307) internal successors, (2063), 859 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2063 transitions. [2022-11-20 20:57:50,133 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2063 transitions. Word has length 18 [2022-11-20 20:57:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:50,133 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 2063 transitions. [2022-11-20 20:57:50,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2063 transitions. [2022-11-20 20:57:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:57:50,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:50,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:50,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-11-20 20:57:50,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 20:57:50,341 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:57:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1651992878, now seen corresponding path program 12 times [2022-11-20 20:57:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:57:50,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145727669] [2022-11-20 20:57:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:57:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:51,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:57:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145727669] [2022-11-20 20:57:51,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145727669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:57:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358453996] [2022-11-20 20:57:51,589 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:57:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:51,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:51,590 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:51,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 20:57:51,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:57:51,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:57:51,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:57:51,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:51,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:51,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:51,893 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:57:51,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:57:51,915 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:57:51,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:57:52,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:57:52,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:57:52,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:57:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:52,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:52,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:57:52,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:57:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:52,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:53,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| Int) (v_ArrVal_3206 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3206) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| 4) |c_~#queue~0.offset|) v_ArrVal_3207) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:57:53,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3206) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| 4) |c_~#queue~0.offset|) v_ArrVal_3207) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:57:55,418 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| Int) (v_ArrVal_3204 Int) (v_ArrVal_3202 Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3202) .cse1 v_ArrVal_3204)) |c_~#stored_elements~0.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3206) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3204) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| 4) |c_~#queue~0.offset|) v_ArrVal_3207) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_3202 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-20 20:57:55,447 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| Int) (v_ArrVal_3204 Int) (v_ArrVal_3202 Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_3202) .cse1 v_ArrVal_3204)) |c_~#stored_elements~0.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3206) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3204) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| 4) |c_~#queue~0.offset|) v_ArrVal_3207) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_3202))))) is different from false [2022-11-20 20:57:55,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3207 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| Int) (v_ArrVal_3204 Int) (v_ArrVal_3202 Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3200 Int) (v_ArrVal_3206 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3200)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_3202) .cse1 v_ArrVal_3204)) |c_~#stored_elements~0.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3206) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3204) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_3202) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_268| 4) |c_~#queue~0.offset|) v_ArrVal_3207) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:58:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:58:03,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358453996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:03,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [862949385] [2022-11-20 20:58:03,830 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:58:03,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:58:03,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:58:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915986527] [2022-11-20 20:58:03,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:03,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:58:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:03,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:58:03,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=701, Unknown=16, NotChecked=310, Total=1260 [2022-11-20 20:58:03,832 INFO L87 Difference]: Start difference. First operand 860 states and 2063 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:04,652 INFO L93 Difference]: Finished difference Result 885 states and 2144 transitions. [2022-11-20 20:58:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:58:04,653 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:58:04,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:04,654 INFO L225 Difference]: With dead ends: 885 [2022-11-20 20:58:04,654 INFO L226 Difference]: Without dead ends: 885 [2022-11-20 20:58:04,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=335, Invalid=1001, Unknown=16, NotChecked=370, Total=1722 [2022-11-20 20:58:04,655 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:04,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 392 Unchecked, 0.2s Time] [2022-11-20 20:58:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-20 20:58:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 860. [2022-11-20 20:58:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 844 states have (on average 2.4443127962085307) internal successors, (2063), 859 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2063 transitions. [2022-11-20 20:58:04,665 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 2063 transitions. Word has length 18 [2022-11-20 20:58:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:04,666 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 2063 transitions. [2022-11-20 20:58:04,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 2063 transitions. [2022-11-20 20:58:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:58:04,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:04,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:04,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:04,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-20 20:58:04,879 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:04,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:04,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1649873626, now seen corresponding path program 13 times [2022-11-20 20:58:04,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:04,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441367608] [2022-11-20 20:58:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:06,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:06,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441367608] [2022-11-20 20:58:06,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441367608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76912860] [2022-11-20 20:58:06,031 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:58:06,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:06,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:06,032 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:06,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 20:58:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:06,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:58:06,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:06,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:06,340 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:58:06,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:58:06,361 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:58:06,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:58:06,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:58:06,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:58:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 49 [2022-11-20 20:58:07,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2022-11-20 20:58:07,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:07,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:07,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:58:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:07,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:07,903 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3307 Int) (v_ArrVal_3311 Int) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3309 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3306))) (store .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_3307))) |c_~#stored_elements~0.base| v_ArrVal_3309) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| 4) |c_~#queue~0.offset|) v_ArrVal_3311) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_3307 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:58:07,924 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3307 Int) (v_ArrVal_3311 Int) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3309 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3306))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1 v_ArrVal_3307))) |c_~#stored_elements~0.base| v_ArrVal_3309) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| 4) |c_~#queue~0.offset|) v_ArrVal_3311) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) v_ArrVal_3307) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:58:07,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3307 Int) (v_ArrVal_3305 Int) (v_ArrVal_3311 Int) (v_ArrVal_3306 (Array Int Int)) (v_ArrVal_3309 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| Int)) (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3305)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3306))) (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2 v_ArrVal_3307))) |c_~#stored_elements~0.base| v_ArrVal_3309) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_3305 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3307) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_273| 4) |c_~#queue~0.offset|) v_ArrVal_3311) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:58:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:17,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76912860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1200509553] [2022-11-20 20:58:17,490 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:58:17,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:58:17,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:58:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220038493] [2022-11-20 20:58:17,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:17,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:58:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:58:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=769, Unknown=27, NotChecked=186, Total=1190 [2022-11-20 20:58:17,493 INFO L87 Difference]: Start difference. First operand 860 states and 2063 transitions. Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:20,977 INFO L93 Difference]: Finished difference Result 1083 states and 2582 transitions. [2022-11-20 20:58:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 20:58:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:58:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:20,979 INFO L225 Difference]: With dead ends: 1083 [2022-11-20 20:58:20,979 INFO L226 Difference]: Without dead ends: 1083 [2022-11-20 20:58:20,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=396, Invalid=1395, Unknown=27, NotChecked=252, Total=2070 [2022-11-20 20:58:20,980 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1201 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:20,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 174 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 448 Invalid, 0 Unknown, 1201 Unchecked, 0.5s Time] [2022-11-20 20:58:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-11-20 20:58:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 853. [2022-11-20 20:58:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 837 states have (on average 2.4420549581839905) internal successors, (2044), 852 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2044 transitions. [2022-11-20 20:58:20,991 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2044 transitions. Word has length 18 [2022-11-20 20:58:20,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:20,991 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 2044 transitions. [2022-11-20 20:58:20,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2044 transitions. [2022-11-20 20:58:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:58:20,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:20,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:20,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:21,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-20 20:58:21,192 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:21,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1654873688, now seen corresponding path program 1 times [2022-11-20 20:58:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:21,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715121358] [2022-11-20 20:58:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:22,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715121358] [2022-11-20 20:58:22,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715121358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293836591] [2022-11-20 20:58:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:22,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:22,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:22,827 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:22,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 20:58:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:23,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:58:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:23,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:23,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:23,140 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:58:23,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:58:23,164 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:58:23,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:58:23,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:58:23,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:58:23,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 20:58:23,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:58:24,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:24,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:24,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:58:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:24,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:24,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_3411 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:58:24,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3409 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3409))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3411) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 20:58:24,877 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3407 Int) (v_ArrVal_3409 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3409))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3411) (not (<= v_ArrVal_3407 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-20 20:58:24,909 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3407 Int) (v_ArrVal_3409 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_3407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3409))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3407) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3411))))))) is different from false [2022-11-20 20:58:24,944 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3407 Int) (v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3406 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3406)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_3407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3409))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_3411) (< (+ (select .cse3 .cse4) 1) v_ArrVal_3407))))))) is different from false [2022-11-20 20:58:24,978 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3407 Int) (v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3406 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| Int) (v_ArrVal_3414 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_279| Int) (v_ArrVal_3412 (Array Int Int)) (v_ArrVal_3411 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_279| 4) |c_~#queue~0.offset|) v_ArrVal_3406)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_3407)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3409))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_3411)) |c_~#stored_elements~0.base| v_ArrVal_3412) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| (select .cse0 .cse1))) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_3411) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_278| 4) |c_~#queue~0.offset|) v_ArrVal_3414) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_279| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_3407)))))))) is different from false [2022-11-20 20:58:25,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:58:25,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293836591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:25,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909914601] [2022-11-20 20:58:25,068 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:58:25,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:58:25,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-20 20:58:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591645326] [2022-11-20 20:58:25,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:25,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:58:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:25,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:58:25,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=594, Unknown=13, NotChecked=354, Total=1190 [2022-11-20 20:58:25,070 INFO L87 Difference]: Start difference. First operand 853 states and 2044 transitions. Second operand has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:25,822 INFO L93 Difference]: Finished difference Result 981 states and 2339 transitions. [2022-11-20 20:58:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:58:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:58:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:25,824 INFO L225 Difference]: With dead ends: 981 [2022-11-20 20:58:25,824 INFO L226 Difference]: Without dead ends: 981 [2022-11-20 20:58:25,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=300, Invalid=767, Unknown=13, NotChecked=402, Total=1482 [2022-11-20 20:58:25,824 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:25,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 99 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 707 Unchecked, 0.2s Time] [2022-11-20 20:58:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-11-20 20:58:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 851. [2022-11-20 20:58:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 835 states have (on average 2.4407185628742516) internal successors, (2038), 850 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 2038 transitions. [2022-11-20 20:58:25,839 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 2038 transitions. Word has length 19 [2022-11-20 20:58:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:25,840 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 2038 transitions. [2022-11-20 20:58:25,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 2038 transitions. [2022-11-20 20:58:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:58:25,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:25,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:25,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-11-20 20:58:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:26,048 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -354318828, now seen corresponding path program 2 times [2022-11-20 20:58:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381584391] [2022-11-20 20:58:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58: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-20 20:58:27,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:27,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381584391] [2022-11-20 20:58:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381584391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:27,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589146531] [2022-11-20 20:58:27,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:58:27,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:27,690 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:27,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-20 20:58:27,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:58:27,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:58:28,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 20:58:28,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:28,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 34 [2022-11-20 20:58:28,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:28,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:28,057 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:58:28,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-20 20:58:28,086 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-20 20:58:28,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-20 20:58:28,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:28,313 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-11-20 20:58:28,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 20:58:28,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:28,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:28,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 20:58:28,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-20 20:58:28,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 20:58:28,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:28,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 20:58:28,909 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 20:58:28,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-20 20:58:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:28,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:29,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3509) |c_~#stored_elements~0.base| v_ArrVal_3510) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_3512) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:58:29,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 Int) (v_ArrVal_3508 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_3508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3509) |c_~#stored_elements~0.base| v_ArrVal_3510) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_3508 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_3512) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:58:29,480 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3506 Int) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 Int) (v_ArrVal_3508 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3506) .cse1 v_ArrVal_3508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3509) |c_~#stored_elements~0.base| v_ArrVal_3510) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3508) (not (<= v_ArrVal_3506 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_3512) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:58:29,521 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3506 Int) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3512 Int) (v_ArrVal_3508 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3506) .cse2 v_ArrVal_3508)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3509) |c_~#stored_elements~0.base| v_ArrVal_3510) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3506) (< (+ (select .cse0 .cse2) 1) v_ArrVal_3508) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| 4) |c_~#queue~0.offset|) v_ArrVal_3512) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_283| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:58:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:58:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589146531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303735980] [2022-11-20 20:58:38,183 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:58:38,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:58:38,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-20 20:58:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352693189] [2022-11-20 20:58:38,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:38,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:58:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:58:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=802, Unknown=20, NotChecked=260, Total=1332 [2022-11-20 20:58:38,185 INFO L87 Difference]: Start difference. First operand 851 states and 2038 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:42,174 INFO L93 Difference]: Finished difference Result 1237 states and 2916 transitions. [2022-11-20 20:58:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:58:42,174 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:58:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:42,176 INFO L225 Difference]: With dead ends: 1237 [2022-11-20 20:58:42,176 INFO L226 Difference]: Without dead ends: 1237 [2022-11-20 20:58:42,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=552, Invalid=1514, Unknown=20, NotChecked=364, Total=2450 [2022-11-20 20:58:42,177 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 342 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 911 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:42,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 115 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 604 Invalid, 0 Unknown, 911 Unchecked, 0.6s Time] [2022-11-20 20:58:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-11-20 20:58:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 820. [2022-11-20 20:58:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 804 states have (on average 2.424129353233831) internal successors, (1949), 819 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1949 transitions. [2022-11-20 20:58:42,189 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1949 transitions. Word has length 19 [2022-11-20 20:58:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:42,189 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1949 transitions. [2022-11-20 20:58:42,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1949 transitions. [2022-11-20 20:58:42,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:58:42,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:42,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:42,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:42,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-20 20:58:42,392 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash -564345378, now seen corresponding path program 3 times [2022-11-20 20:58:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:42,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127343119] [2022-11-20 20:58:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:43,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:43,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127343119] [2022-11-20 20:58:43,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127343119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:43,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336634113] [2022-11-20 20:58:43,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:58:43,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:43,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:43,903 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:43,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-20 20:58:44,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:58:44,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:58:44,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 20:58:44,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:44,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:44,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:44,235 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:58:44,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:58:44,256 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:58:44,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:58:44,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:58:44,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:58:44,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:58:44,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:45,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:45,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:45,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:58:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:45,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:45,542 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| Int) (v_ArrVal_3613 Int) (v_ArrVal_3612 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3612) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| 4)) v_ArrVal_3613) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:58:46,007 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| Int) (v_ArrVal_3613 Int) (v_ArrVal_3610 Int) (v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3612 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_3610)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3611) |c_~#stored_elements~0.base| v_ArrVal_3612) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3610) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| 4)) v_ArrVal_3613) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:58:48,069 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| Int) (v_ArrVal_3613 Int) (v_ArrVal_3610 Int) (v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3608 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3608) .cse2 v_ArrVal_3610)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3611) |c_~#stored_elements~0.base| v_ArrVal_3612) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| 4)) v_ArrVal_3613) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3610) (not (<= v_ArrVal_3608 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-20 20:58:48,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| Int) (v_ArrVal_3613 Int) (v_ArrVal_3610 Int) (v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3608 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_3608) .cse3 v_ArrVal_3610)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3611) |c_~#stored_elements~0.base| v_ArrVal_3612) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| 4)) v_ArrVal_3613) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3608) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3610))))) is different from false [2022-11-20 20:58:48,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3606 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| Int) (v_ArrVal_3613 Int) (v_ArrVal_3610 Int) (v_ArrVal_3611 (Array Int Int)) (v_ArrVal_3612 (Array Int Int)) (v_ArrVal_3608 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3606)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_3608) .cse3 v_ArrVal_3610)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3611) |c_~#stored_elements~0.base| v_ArrVal_3612) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_288| 4)) v_ArrVal_3613) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3608) (< (+ (select .cse1 .cse3) 1) v_ArrVal_3610))))) is different from false [2022-11-20 20:58:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:58:53,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336634113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:53,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378701838] [2022-11-20 20:58:53,003 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:58:53,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:58:53,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:58:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109226920] [2022-11-20 20:58:53,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:53,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:58:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:58:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=708, Unknown=16, NotChecked=310, Total=1260 [2022-11-20 20:58:53,005 INFO L87 Difference]: Start difference. First operand 820 states and 1949 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:54,320 INFO L93 Difference]: Finished difference Result 1096 states and 2571 transitions. [2022-11-20 20:58:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:58:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:58:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:54,322 INFO L225 Difference]: With dead ends: 1096 [2022-11-20 20:58:54,322 INFO L226 Difference]: Without dead ends: 1096 [2022-11-20 20:58:54,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=384, Invalid=1026, Unknown=16, NotChecked=380, Total=1806 [2022-11-20 20:58:54,323 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:54,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 145 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 570 Unchecked, 0.4s Time] [2022-11-20 20:58:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-11-20 20:58:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 846. [2022-11-20 20:58:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 830 states have (on average 2.4373493975903613) internal successors, (2023), 845 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 2023 transitions. [2022-11-20 20:58:54,336 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 2023 transitions. Word has length 19 [2022-11-20 20:58:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:54,336 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 2023 transitions. [2022-11-20 20:58:54,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 2023 transitions. [2022-11-20 20:58:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:58:54,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:54,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:54,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-20 20:58:54,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-11-20 20:58:54,538 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash -564344386, now seen corresponding path program 1 times [2022-11-20 20:58:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:54,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823148047] [2022-11-20 20:58:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:58:54,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:54,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823148047] [2022-11-20 20:58:54,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823148047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:58:54,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:58:54,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:58:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312853907] [2022-11-20 20:58:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:58:54,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:58:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:58:54,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:58:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:58:54,598 INFO L87 Difference]: Start difference. First operand 846 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:58:54,699 INFO L93 Difference]: Finished difference Result 512 states and 1033 transitions. [2022-11-20 20:58:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:58:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:58:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:58:54,700 INFO L225 Difference]: With dead ends: 512 [2022-11-20 20:58:54,701 INFO L226 Difference]: Without dead ends: 510 [2022-11-20 20:58:54,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 20:58:54,701 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:58:54,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:58:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-20 20:58:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 482. [2022-11-20 20:58:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 466 states have (on average 2.128755364806867) internal successors, (992), 481 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 992 transitions. [2022-11-20 20:58:54,710 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 992 transitions. Word has length 19 [2022-11-20 20:58:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:58:54,710 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 992 transitions. [2022-11-20 20:58:54,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:58:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 992 transitions. [2022-11-20 20:58:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:58:54,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:58:54,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:58:54,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-20 20:58:54,712 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:58:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:58:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -564300738, now seen corresponding path program 4 times [2022-11-20 20:58:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:58:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053955236] [2022-11-20 20:58:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:58:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:56,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:58:56,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053955236] [2022-11-20 20:58:56,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053955236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:58:56,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247286800] [2022-11-20 20:58:56,333 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:58:56,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:56,334 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:56,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-20 20:58:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:56,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 20:58:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:56,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:56,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:56,670 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:58:56,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:58:56,691 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:58:56,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:58:56,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:58:56,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:58:57,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:58:57,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:57,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:57,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:58:57,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:58:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:57,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:58,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3757 Int) (v_ArrVal_3756 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3756) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| 4)) v_ArrVal_3757) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:58:58,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3757 Int) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3755) |c_~#stored_elements~0.base| v_ArrVal_3756) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| 4)) v_ArrVal_3757) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:58:58,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3757 Int) (v_ArrVal_3753 Int) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_3753)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3755) |c_~#stored_elements~0.base| v_ArrVal_3756) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_3753 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| 4)) v_ArrVal_3757) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:58:58,335 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_3757 Int) (v_ArrVal_3753 Int) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| Int)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_3753)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3755) |c_~#stored_elements~0.base| v_ArrVal_3756) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| 4)) v_ArrVal_3757) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_3753))))))) is different from false [2022-11-20 20:58:58,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3749 Int) (v_ArrVal_3757 Int) (v_ArrVal_3753 Int) (v_ArrVal_3751 Int) (v_ArrVal_3755 (Array Int Int)) (v_ArrVal_3756 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3749)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_3751) .cse4 v_ArrVal_3753)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3755) |c_~#stored_elements~0.base| v_ArrVal_3756) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_3753) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_3751) (= 400 .cse0) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_293| 4)) v_ArrVal_3757) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 20:59:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:59:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247286800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:04,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2083006517] [2022-11-20 20:59:04,287 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:59:04,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:04,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-20 20:59:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536402742] [2022-11-20 20:59:04,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:04,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:59:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:59:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=767, Unknown=18, NotChecked=320, Total=1332 [2022-11-20 20:59:04,289 INFO L87 Difference]: Start difference. First operand 482 states and 992 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:05,697 INFO L93 Difference]: Finished difference Result 519 states and 1062 transitions. [2022-11-20 20:59:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:59:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:59:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:05,698 INFO L225 Difference]: With dead ends: 519 [2022-11-20 20:59:05,698 INFO L226 Difference]: Without dead ends: 519 [2022-11-20 20:59:05,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=380, Invalid=1261, Unknown=19, NotChecked=410, Total=2070 [2022-11-20 20:59:05,700 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:05,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 90 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 559 Unchecked, 0.2s Time] [2022-11-20 20:59:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-20 20:59:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 477. [2022-11-20 20:59:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 461 states have (on average 2.125813449023861) internal successors, (980), 476 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 980 transitions. [2022-11-20 20:59:05,709 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 980 transitions. Word has length 19 [2022-11-20 20:59:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:05,709 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 980 transitions. [2022-11-20 20:59:05,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 980 transitions. [2022-11-20 20:59:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:59:05,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:05,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:59:05,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:05,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-20 20:59:05,917 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:59:05,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash 97859244, now seen corresponding path program 5 times [2022-11-20 20:59:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:05,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127275158] [2022-11-20 20:59:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:05,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:06,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127275158] [2022-11-20 20:59:06,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127275158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066113661] [2022-11-20 20:59:06,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:59:06,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:06,748 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:06,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-20 20:59:07,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:59:07,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:59:07,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 20:59:07,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:07,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:07,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:07,121 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:59:07,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:59:07,146 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-20 20:59:07,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-20 20:59:07,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:59:07,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:59:07,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:59:07,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:07,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:07,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:08,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:59:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:08,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:08,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| Int) (v_ArrVal_3857 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3857) |c_~#stored_elements~0.base| v_ArrVal_3858) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| 4)) v_ArrVal_3859) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:59:09,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3859 Int) (v_ArrVal_3856 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| Int) (v_ArrVal_3857 (Array Int Int)) (v_ArrVal_3858 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3856)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3857) |c_~#stored_elements~0.base| v_ArrVal_3858) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| 4)) v_ArrVal_3859) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_298| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3856))))) is different from false [2022-11-20 20:59:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:25,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066113661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:25,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [490826859] [2022-11-20 20:59:25,349 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:59:25,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:25,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:59:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937978920] [2022-11-20 20:59:25,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:25,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:59:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:59:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=830, Unknown=35, NotChecked=130, Total=1260 [2022-11-20 20:59:25,351 INFO L87 Difference]: Start difference. First operand 477 states and 980 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:26,493 INFO L93 Difference]: Finished difference Result 546 states and 1110 transitions. [2022-11-20 20:59:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:59:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:59:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:26,495 INFO L225 Difference]: With dead ends: 546 [2022-11-20 20:59:26,495 INFO L226 Difference]: Without dead ends: 546 [2022-11-20 20:59:26,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=460, Invalid=1319, Unknown=35, NotChecked=166, Total=1980 [2022-11-20 20:59:26,496 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:26,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 581 Unchecked, 0.2s Time] [2022-11-20 20:59:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-20 20:59:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 480. [2022-11-20 20:59:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 464 states have (on average 2.127155172413793) internal successors, (987), 479 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 987 transitions. [2022-11-20 20:59:26,503 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 987 transitions. Word has length 19 [2022-11-20 20:59:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:26,503 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 987 transitions. [2022-11-20 20:59:26,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 987 transitions. [2022-11-20 20:59:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:59:26,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:26,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:59:26,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:26,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:26,705 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:59:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash 97903884, now seen corresponding path program 6 times [2022-11-20 20:59:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:26,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223180940] [2022-11-20 20:59:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:28,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223180940] [2022-11-20 20:59:28,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223180940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226482209] [2022-11-20 20:59:28,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:59:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:28,003 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:28,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-20 20:59:28,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:59:28,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:59:28,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:59:28,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:28,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:28,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:28,347 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:59:28,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:59:28,369 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:59:28,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:59:28,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:59:28,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:59:28,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:59:29,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:29,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:29,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:29,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:59:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:29,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:29,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3961 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| Int) (v_ArrVal_3963 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3961) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| 4)) v_ArrVal_3963) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 20:59:30,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3958 Int) (v_ArrVal_3960 (Array Int Int)) (v_ArrVal_3961 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| Int) (v_ArrVal_3963 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_3958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3960) |c_~#stored_elements~0.base| v_ArrVal_3961) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_3958 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| 4)) v_ArrVal_3963) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:59:30,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3958 Int) (v_ArrVal_3960 (Array Int Int)) (v_ArrVal_3961 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| Int) (v_ArrVal_3963 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_3958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3960) |c_~#stored_elements~0.base| v_ArrVal_3961) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| 4)) v_ArrVal_3963) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3958) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:59:32,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3957 Int) (v_ArrVal_3958 Int) (v_ArrVal_3955 Int) (v_ArrVal_3960 (Array Int Int)) (v_ArrVal_3961 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| Int) (v_ArrVal_3963 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3955)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3957) .cse3 v_ArrVal_3958)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_3960) |c_~#stored_elements~0.base| v_ArrVal_3961) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3957) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| 4)) v_ArrVal_3963) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_3958) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_303| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 20:59:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 20:59:41,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226482209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:41,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354926635] [2022-11-20 20:59:41,716 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:59:41,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:59:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579975208] [2022-11-20 20:59:41,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:41,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:59:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:59:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=744, Unknown=24, NotChecked=252, Total=1260 [2022-11-20 20:59:41,718 INFO L87 Difference]: Start difference. First operand 480 states and 987 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:42,953 INFO L93 Difference]: Finished difference Result 522 states and 1068 transitions. [2022-11-20 20:59:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 20:59:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:59:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:42,954 INFO L225 Difference]: With dead ends: 522 [2022-11-20 20:59:42,954 INFO L226 Difference]: Without dead ends: 522 [2022-11-20 20:59:42,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=382, Invalid=1170, Unknown=24, NotChecked=316, Total=1892 [2022-11-20 20:59:42,955 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:42,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 90 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 389 Unchecked, 0.1s Time] [2022-11-20 20:59:42,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-20 20:59:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 479. [2022-11-20 20:59:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 463 states have (on average 2.127429805615551) internal successors, (985), 478 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 985 transitions. [2022-11-20 20:59:42,961 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 985 transitions. Word has length 19 [2022-11-20 20:59:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:42,962 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 985 transitions. [2022-11-20 20:59:42,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 985 transitions. [2022-11-20 20:59:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:59:42,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:42,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:59:42,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:43,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-20 20:59:43,163 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:59:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash 95655144, now seen corresponding path program 7 times [2022-11-20 20:59:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:43,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031500165] [2022-11-20 20:59:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:43,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:44,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-20 20:59:44,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031500165] [2022-11-20 20:59:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031500165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380964700] [2022-11-20 20:59:44,226 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:59:44,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:44,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:44,230 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:44,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-20 20:59:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:44,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 20:59:44,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:44,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:44,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:44,607 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 20:59:44,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 20:59:44,644 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 20:59:44,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 20:59:44,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 20:59:45,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:59:45,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 20:59:45,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:45,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:45,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 20:59:45,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 20:59:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:45,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:46,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (v_ArrVal_4064 Int) (v_ArrVal_4063 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4063) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) v_ArrVal_4064) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:59:46,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| Int) (v_ArrVal_4062 (Array Int Int)) (v_ArrVal_4064 Int) (v_ArrVal_4063 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4062) |c_~#stored_elements~0.base| v_ArrVal_4063) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| 4) |c_~#queue~0.offset|) v_ArrVal_4064) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_308| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 20:59:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:57,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380964700] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:59:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [996750956] [2022-11-20 20:59:57,435 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:59:57,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:59:57,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 20:59:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674924000] [2022-11-20 20:59:57,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:59:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:59:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:59:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:59:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=843, Unknown=24, NotChecked=130, Total=1260 [2022-11-20 20:59:57,437 INFO L87 Difference]: Start difference. First operand 479 states and 985 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:58,620 INFO L93 Difference]: Finished difference Result 584 states and 1154 transitions. [2022-11-20 20:59:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:59:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:59:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:58,622 INFO L225 Difference]: With dead ends: 584 [2022-11-20 20:59:58,622 INFO L226 Difference]: Without dead ends: 584 [2022-11-20 20:59:58,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=417, Invalid=1289, Unknown=24, NotChecked=162, Total=1892 [2022-11-20 20:59:58,623 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 875 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:58,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 67 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 875 Unchecked, 0.2s Time] [2022-11-20 20:59:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-20 20:59:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 475. [2022-11-20 20:59:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 459 states have (on average 2.1263616557734206) internal successors, (976), 474 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 976 transitions. [2022-11-20 20:59:58,633 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 976 transitions. Word has length 19 [2022-11-20 20:59:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:58,633 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 976 transitions. [2022-11-20 20:59:58,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 976 transitions. [2022-11-20 20:59:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:59:58,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:58,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:59:58,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:58,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-20 20:59:58,838 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 20:59:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash 546944808, now seen corresponding path program 8 times [2022-11-20 20:59:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:59:58,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374518643] [2022-11-20 20:59:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:59:58,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:59:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:59:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:59,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:59:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374518643] [2022-11-20 20:59:59,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374518643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:59:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260548838] [2022-11-20 20:59:59,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:59:59,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:59,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:59:59,677 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:59:59,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-20 21:00:00,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:00:00,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:00:00,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 21:00:00,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:00,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:00,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:00,074 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:00:00,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:00:00,098 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:00:00,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:00:00,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:00:00,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:00:00,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:00:00,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:00,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:00,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:01,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:00:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:01,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:01,345 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| Int) (v_ArrVal_4168 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4166) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| 4) |c_~#queue~0.offset|) v_ArrVal_4168) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 21:00:01,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| Int) (v_ArrVal_4168 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4165) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4166) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| 4) |c_~#queue~0.offset|) v_ArrVal_4168) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 21:00:03,391 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| Int) (v_ArrVal_4168 Int) (v_ArrVal_4164 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4164)) |c_~#stored_elements~0.base| v_ArrVal_4165) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4166) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_4164 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| 4) |c_~#queue~0.offset|) v_ArrVal_4168) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 21:00:04,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4162 Int) (v_ArrVal_4165 (Array Int Int)) (v_ArrVal_4166 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| Int) (v_ArrVal_4168 Int) (v_ArrVal_4164 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4162) .cse2 v_ArrVal_4164)) |c_~#stored_elements~0.base| v_ArrVal_4165) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4166) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4162) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4164) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| 4) |c_~#queue~0.offset|) v_ArrVal_4168) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_313| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 21:00:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 21:00:13,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260548838] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:13,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531782896] [2022-11-20 21:00:13,910 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:00:13,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:13,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 21:00:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374733110] [2022-11-20 21:00:13,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:00:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:00:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=734, Unknown=22, NotChecked=252, Total=1260 [2022-11-20 21:00:13,912 INFO L87 Difference]: Start difference. First operand 475 states and 976 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:19,659 INFO L93 Difference]: Finished difference Result 584 states and 1155 transitions. [2022-11-20 21:00:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 21:00:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:00:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:19,660 INFO L225 Difference]: With dead ends: 584 [2022-11-20 21:00:19,660 INFO L226 Difference]: Without dead ends: 584 [2022-11-20 21:00:19,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=390, Invalid=1084, Unknown=24, NotChecked=308, Total=1806 [2022-11-20 21:00:19,661 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 97 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:19,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 70 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 185 Invalid, 0 Unknown, 749 Unchecked, 0.2s Time] [2022-11-20 21:00:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-11-20 21:00:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 472. [2022-11-20 21:00:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 456 states have (on average 2.125) internal successors, (969), 471 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 969 transitions. [2022-11-20 21:00:19,668 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 969 transitions. Word has length 19 [2022-11-20 21:00:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:19,668 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 969 transitions. [2022-11-20 21:00:19,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 969 transitions. [2022-11-20 21:00:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:00:19,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:19,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:00:19,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:19,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-20 21:00:19,870 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:00:19,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1057914270, now seen corresponding path program 1 times [2022-11-20 21:00:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:19,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470421363] [2022-11-20 21:00:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:20,340 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-20 21:00:20,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:20,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470421363] [2022-11-20 21:00:20,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470421363] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:20,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111651142] [2022-11-20 21:00:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:20,342 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:20,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-20 21:00:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:20,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 21:00:20,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:20,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:20,699 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:00:20,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:00:20,714 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:00:20,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:00:20,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:00:20,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:00:21,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:00:21,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:21,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:21,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:00:21,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:00:21,700 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-20 21:00:21,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:21,807 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4268 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4266) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| 4)) v_ArrVal_4268) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| (select .cse0 .cse1)))))) is different from false [2022-11-20 21:00:21,825 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4268 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| Int) (v_ArrVal_4265 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4265)) |c_~#stored_elements~0.base| v_ArrVal_4266) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (not (<= v_ArrVal_4265 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| 4)) v_ArrVal_4268) .cse1) 2147483647)))) is different from false [2022-11-20 21:00:21,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4268 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| Int) (v_ArrVal_4265 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_4265)) |c_~#stored_elements~0.base| v_ArrVal_4266) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_4265) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_318| 4)) v_ArrVal_4268) .cse1) 2147483647))))) is different from false [2022-11-20 21:00:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:00:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111651142] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2030356407] [2022-11-20 21:00:22,626 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:00:22,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 21:00:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251673705] [2022-11-20 21:00:22,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:22,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 21:00:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 21:00:22,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=469, Unknown=14, NotChecked=150, Total=812 [2022-11-20 21:00:22,629 INFO L87 Difference]: Start difference. First operand 472 states and 969 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:22,964 INFO L93 Difference]: Finished difference Result 475 states and 977 transitions. [2022-11-20 21:00:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:00:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:00:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:22,965 INFO L225 Difference]: With dead ends: 475 [2022-11-20 21:00:22,965 INFO L226 Difference]: Without dead ends: 475 [2022-11-20 21:00:22,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=577, Unknown=14, NotChecked=168, Total=992 [2022-11-20 21:00:22,966 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:22,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 183 Unchecked, 0.1s Time] [2022-11-20 21:00:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-20 21:00:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-20 21:00:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 459 states have (on average 2.128540305010893) internal successors, (977), 474 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 977 transitions. [2022-11-20 21:00:22,972 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 977 transitions. Word has length 19 [2022-11-20 21:00:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:22,972 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 977 transitions. [2022-11-20 21:00:22,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 977 transitions. [2022-11-20 21:00:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:00:22,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:22,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:00:22,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:23,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:23,178 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:00:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1057914284, now seen corresponding path program 1 times [2022-11-20 21:00:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:23,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540563592] [2022-11-20 21:00:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:23,652 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-20 21:00:23,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540563592] [2022-11-20 21:00:23,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540563592] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422821060] [2022-11-20 21:00:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:23,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:23,655 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:23,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-20 21:00:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:23,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 21:00:23,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:23,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:23,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:24,005 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:00:24,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:00:24,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:00:24,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 21:00:24,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:00:24,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:00:24,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:00:24,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:24,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:24,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:00:24,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:00:25,068 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-20 21:00:25,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:25,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| Int) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4365 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4365) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| 1))) |c_~#stored_elements~0.base| v_ArrVal_4368) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= 0 (+ 2147483649 |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289|))) (<= 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| 4) |c_~#queue~0.offset|) v_ArrVal_4370) .cse1) 2147483649)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| (select .cse2 .cse3))))))) is different from false [2022-11-20 21:00:25,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4370 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| Int) (v_ArrVal_4368 (Array Int Int)) (v_ArrVal_4365 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| Int) (v_ArrVal_4362 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4362)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4365) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| 1))) |c_~#stored_elements~0.base| v_ArrVal_4368) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= 0 (+ 2147483649 |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| (select .cse0 .cse1))) (<= 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_323| 4) |c_~#queue~0.offset|) v_ArrVal_4370) .cse1) 2147483649)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_289| (select .cse2 .cse3))))))) is different from false [2022-11-20 21:00:25,789 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-20 21:00:25,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422821060] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:25,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [768953663] [2022-11-20 21:00:25,790 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:00:25,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:25,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 24 [2022-11-20 21:00:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27479276] [2022-11-20 21:00:25,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:25,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 21:00:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 21:00:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=420, Unknown=7, NotChecked=90, Total=650 [2022-11-20 21:00:25,793 INFO L87 Difference]: Start difference. First operand 475 states and 977 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:26,603 INFO L93 Difference]: Finished difference Result 522 states and 1070 transitions. [2022-11-20 21:00:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 21:00:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:00:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:26,604 INFO L225 Difference]: With dead ends: 522 [2022-11-20 21:00:26,604 INFO L226 Difference]: Without dead ends: 522 [2022-11-20 21:00:26,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=697, Unknown=7, NotChecked=118, Total=1056 [2022-11-20 21:00:26,605 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 622 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:26,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 77 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 622 Unchecked, 0.3s Time] [2022-11-20 21:00:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-20 21:00:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 515. [2022-11-20 21:00:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 499 states have (on average 2.130260521042084) internal successors, (1063), 514 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1063 transitions. [2022-11-20 21:00:26,611 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1063 transitions. Word has length 19 [2022-11-20 21:00:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:26,612 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 1063 transitions. [2022-11-20 21:00:26,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1063 transitions. [2022-11-20 21:00:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:00:26,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:26,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:00:26,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:26,819 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:00:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 327829328, now seen corresponding path program 9 times [2022-11-20 21:00:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283215489] [2022-11-20 21:00:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:28,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283215489] [2022-11-20 21:00:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283215489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708360816] [2022-11-20 21:00:28,126 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:00:28,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:28,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:28,127 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:28,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-20 21:00:28,460 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:00:28,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:00:28,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 21:00:28,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:28,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:28,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:28,493 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:00:28,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:00:28,515 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:00:28,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:00:28,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:00:28,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:00:29,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:00:29,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:29,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:29,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:29,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:00:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:29,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:30,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| Int) (v_ArrVal_4474 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4471) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4472) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| 4)) v_ArrVal_4474) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 21:00:30,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4470 Int) (v_ArrVal_4472 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| Int) (v_ArrVal_4474 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4470)) |c_~#stored_elements~0.base| v_ArrVal_4471) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4472) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_328| 4)) v_ArrVal_4474) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_4470 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 21:00:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:45,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708360816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:00:45,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523514123] [2022-11-20 21:00:45,287 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:00:45,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:00:45,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 21:00:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450924058] [2022-11-20 21:00:45,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:00:45,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:00:45,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:00:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:00:45,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=840, Unknown=41, NotChecked=130, Total=1260 [2022-11-20 21:00:45,288 INFO L87 Difference]: Start difference. First operand 515 states and 1063 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:00:47,940 INFO L93 Difference]: Finished difference Result 539 states and 1107 transitions. [2022-11-20 21:00:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 21:00:47,940 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:00:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:00:47,941 INFO L225 Difference]: With dead ends: 539 [2022-11-20 21:00:47,941 INFO L226 Difference]: Without dead ends: 539 [2022-11-20 21:00:47,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=338, Invalid=1035, Unknown=41, NotChecked=146, Total=1560 [2022-11-20 21:00:47,942 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:00:47,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 291 Unchecked, 0.1s Time] [2022-11-20 21:00:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-20 21:00:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 514. [2022-11-20 21:00:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 498 states have (on average 2.1305220883534135) internal successors, (1061), 513 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1061 transitions. [2022-11-20 21:00:47,951 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1061 transitions. Word has length 19 [2022-11-20 21:00:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:00:47,952 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 1061 transitions. [2022-11-20 21:00:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:00:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1061 transitions. [2022-11-20 21:00:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:00:47,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:00:47,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:00:47,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-20 21:00:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-11-20 21:00:48,159 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:00:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:00:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 327873968, now seen corresponding path program 10 times [2022-11-20 21:00:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:00:48,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841411131] [2022-11-20 21:00:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:00:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:00:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:50,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:00:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841411131] [2022-11-20 21:00:50,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841411131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:00:50,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428337858] [2022-11-20 21:00:50,142 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:00:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:00:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:00:50,143 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:00:50,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-20 21:00:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:00:50,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:00:50,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:00:50,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:50,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:50,517 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:00:50,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:00:50,541 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:00:50,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:00:50,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:00:50,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:00:51,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:00:51,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:00:51,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:51,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:00:51,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:00:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:00:51,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:00:51,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| Int) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4577 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4575) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| 4)) v_ArrVal_4577) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 21:00:52,113 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4574 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| Int) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4577 Int) (v_ArrVal_4572 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4572)) |c_~#stored_elements~0.base| v_ArrVal_4574) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4575) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| 4)) v_ArrVal_4577) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_4572 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-20 21:00:52,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4574 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| Int) (v_ArrVal_4575 (Array Int Int)) (v_ArrVal_4577 Int) (v_ArrVal_4572 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_4572)) |c_~#stored_elements~0.base| v_ArrVal_4574) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4575) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| 4)) v_ArrVal_4577) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_333| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4572))))) is different from false [2022-11-20 21:01:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:04,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428337858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:04,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1696287494] [2022-11-20 21:01:04,102 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:04,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:04,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 21:01:04,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960678922] [2022-11-20 21:01:04,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:04,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:01:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:04,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:01:04,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=799, Unknown=28, NotChecked=192, Total=1260 [2022-11-20 21:01:04,104 INFO L87 Difference]: Start difference. First operand 514 states and 1061 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:05,271 INFO L93 Difference]: Finished difference Result 605 states and 1209 transitions. [2022-11-20 21:01:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:01:05,271 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:01:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:05,272 INFO L225 Difference]: With dead ends: 605 [2022-11-20 21:01:05,272 INFO L226 Difference]: Without dead ends: 605 [2022-11-20 21:01:05,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=373, Invalid=1093, Unknown=28, NotChecked=228, Total=1722 [2022-11-20 21:01:05,273 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 141 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:05,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 78 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 304 Invalid, 0 Unknown, 884 Unchecked, 0.4s Time] [2022-11-20 21:01:05,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-20 21:01:05,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 508. [2022-11-20 21:01:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 492 states have (on average 2.130081300813008) internal successors, (1048), 507 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:05,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1048 transitions. [2022-11-20 21:01:05,278 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1048 transitions. Word has length 19 [2022-11-20 21:01:05,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:05,278 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 1048 transitions. [2022-11-20 21:01:05,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:05,279 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1048 transitions. [2022-11-20 21:01:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:01:05,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:05,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:05,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:05,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:05,480 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:05,480 INFO L85 PathProgramCache]: Analyzing trace with hash -916977924, now seen corresponding path program 11 times [2022-11-20 21:01:05,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:05,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284764306] [2022-11-20 21:01:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:06,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:06,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284764306] [2022-11-20 21:01:06,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284764306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:06,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776006318] [2022-11-20 21:01:06,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:01:06,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:06,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:06,715 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:06,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-20 21:01:07,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:01:07,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:07,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-20 21:01:07,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:07,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:07,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:07,156 INFO L321 Elim1Store]: treesize reduction 65, result has 27.8 percent of original size [2022-11-20 21:01:07,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 58 [2022-11-20 21:01:07,182 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:07,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:07,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:07,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 21:01:07,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:01:07,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:01:07,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:07,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:08,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:01:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:08,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:08,604 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4680 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 21:01:08,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4680 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_4677 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-20 21:01:08,678 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4680 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4677))))) is different from false [2022-11-20 21:01:08,727 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4674 Int) (v_ArrVal_4680 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4674) .cse2 v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_4674 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4677) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 21:01:08,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4673 (Array Int Int)) (v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4674 Int) (v_ArrVal_4680 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4673))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_4674) .cse2 v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4677) (< (+ (select .cse1 .cse3) 1) v_ArrVal_4674)))))) is different from false [2022-11-20 21:01:09,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4673 (Array Int Int)) (v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (v_ArrVal_4674 Int) (v_ArrVal_4671 Int) (v_ArrVal_4680 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4671)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4673))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4674) .cse2 v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4674) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4677) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse3 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 21:01:09,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4673 (Array Int Int)) (v_ArrVal_4677 Int) (v_ArrVal_4678 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_339| Int) (v_ArrVal_4674 Int) (v_ArrVal_4671 Int) (v_ArrVal_4680 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_339| 4)) v_ArrVal_4671)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4673))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_4674) .cse2 v_ArrVal_4677)) |c_~#stored_elements~0.base| v_ArrVal_4678) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_4674) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4677) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| 4)) v_ArrVal_4680) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_338| (select .cse3 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_339| (select .cse4 .cse2))))))))) is different from false [2022-11-20 21:01:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:01:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776006318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:09,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50430159] [2022-11-20 21:01:09,159 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:09,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:09,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-20 21:01:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389620339] [2022-11-20 21:01:09,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:09,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 21:01:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:09,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 21:01:09,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=599, Unknown=11, NotChecked=420, Total=1260 [2022-11-20 21:01:09,171 INFO L87 Difference]: Start difference. First operand 508 states and 1048 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:12,189 INFO L93 Difference]: Finished difference Result 526 states and 1081 transitions. [2022-11-20 21:01:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 21:01:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:01:12,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:12,191 INFO L225 Difference]: With dead ends: 526 [2022-11-20 21:01:12,191 INFO L226 Difference]: Without dead ends: 526 [2022-11-20 21:01:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=392, Invalid=1031, Unknown=11, NotChecked=546, Total=1980 [2022-11-20 21:01:12,191 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:12,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 179 Invalid, 0 Unknown, 471 Unchecked, 0.2s Time] [2022-11-20 21:01:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-20 21:01:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 506. [2022-11-20 21:01:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 490 states have (on average 2.130612244897959) internal successors, (1044), 505 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1044 transitions. [2022-11-20 21:01:12,196 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1044 transitions. Word has length 19 [2022-11-20 21:01:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:12,197 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 1044 transitions. [2022-11-20 21:01:12,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1044 transitions. [2022-11-20 21:01:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:01:12,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:12,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:12,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-20 21:01:12,398 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash 149566350, now seen corresponding path program 12 times [2022-11-20 21:01:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:12,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625772309] [2022-11-20 21:01:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:14,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:14,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625772309] [2022-11-20 21:01:14,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625772309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:14,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407561764] [2022-11-20 21:01:14,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:01:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:14,045 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:14,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-20 21:01:14,388 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:01:14,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:14,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:01:14,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:14,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:14,427 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:14,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:14,450 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:14,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:14,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:14,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 21:01:14,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:01:15,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:01:15,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:15,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:15,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:01:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:15,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:16,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_4780 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-20 21:01:16,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4780) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 21:01:16,260 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (v_ArrVal_4778 Int) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4778) .cse1 v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4780) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_4778 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-20 21:01:18,476 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (v_ArrVal_4778 Int) (v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4776))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_4778) .cse3 v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_4778) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_4780)))))) is different from false [2022-11-20 21:01:18,517 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (v_ArrVal_4778 Int) (v_ArrVal_4774 Int) (v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4774)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4776))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_4778) .cse3 v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4778) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_4780)))))) is different from false [2022-11-20 21:01:18,554 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4781 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_344| Int) (v_ArrVal_4778 Int) (v_ArrVal_4774 Int) (v_ArrVal_4776 (Array Int Int)) (v_ArrVal_4782 Int) (v_ArrVal_4780 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_344| 4) |c_~#queue~0.offset|) v_ArrVal_4774)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4776))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_4778) .cse2 v_ArrVal_4780)) |c_~#stored_elements~0.base| v_ArrVal_4781) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4778) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4780) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_344| (select .cse3 .cse2))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| 4) |c_~#queue~0.offset|) v_ArrVal_4782) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_343| (select .cse4 .cse2))))))))) is different from false [2022-11-20 21:01:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:01:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407561764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:18,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [900754917] [2022-11-20 21:01:18,751 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:18,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:18,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-20 21:01:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42726783] [2022-11-20 21:01:18,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:18,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 21:01:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:18,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 21:01:18,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=696, Unknown=17, NotChecked=378, Total=1332 [2022-11-20 21:01:18,752 INFO L87 Difference]: Start difference. First operand 506 states and 1044 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:22,269 INFO L93 Difference]: Finished difference Result 594 states and 1185 transitions. [2022-11-20 21:01:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 21:01:22,270 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:01:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:22,271 INFO L225 Difference]: With dead ends: 594 [2022-11-20 21:01:22,271 INFO L226 Difference]: Without dead ends: 594 [2022-11-20 21:01:22,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=400, Invalid=1089, Unknown=17, NotChecked=474, Total=1980 [2022-11-20 21:01:22,272 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 98 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:22,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 61 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 238 Invalid, 0 Unknown, 652 Unchecked, 0.2s Time] [2022-11-20 21:01:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-11-20 21:01:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 505. [2022-11-20 21:01:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 489 states have (on average 2.130879345603272) internal successors, (1042), 504 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1042 transitions. [2022-11-20 21:01:22,277 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1042 transitions. Word has length 19 [2022-11-20 21:01:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:22,278 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 1042 transitions. [2022-11-20 21:01:22,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1042 transitions. [2022-11-20 21:01:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:01:22,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:22,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:22,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-11-20 21:01:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-20 21:01:22,479 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash 156107456, now seen corresponding path program 13 times [2022-11-20 21:01:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508131763] [2022-11-20 21:01:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:23,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-20 21:01:23,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508131763] [2022-11-20 21:01:23,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508131763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:23,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759508374] [2022-11-20 21:01:23,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:01:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:23,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:23,433 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:23,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-20 21:01:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:23,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:01:23,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:23,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:23,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:23,829 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:23,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:23,864 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:23,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:24,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:24,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 21:01:24,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:01:24,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:01:24,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:24,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:24,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:01:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:25,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:26,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4879 Int) (v_ArrVal_4883 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| Int) (v_ArrVal_4885 Int) (v_ArrVal_4878 (Array Int Int)) (v_ArrVal_4881 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4878))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_4879) .cse5 v_ArrVal_4881)) |c_~#stored_elements~0.base| v_ArrVal_4883) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse1 1) v_ArrVal_4881) (= .cse1 400) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| 4)) v_ArrVal_4885) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_4879)))))) is different from false [2022-11-20 21:01:26,193 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4879 Int) (v_ArrVal_4877 Int) (v_ArrVal_4883 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| Int) (v_ArrVal_4885 Int) (v_ArrVal_4878 (Array Int Int)) (v_ArrVal_4881 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4877)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4878))) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse2 .cse5)) (.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_4879) .cse5 v_ArrVal_4881)) |c_~#stored_elements~0.base| v_ArrVal_4883) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| 4)) v_ArrVal_4885) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse1) (< (+ .cse1 1) v_ArrVal_4881) (< (+ (select .cse2 .cse3) 1) v_ArrVal_4879) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-20 21:01:26,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4879 Int) (v_ArrVal_4877 Int) (v_ArrVal_4883 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_349| Int) (v_ArrVal_4885 Int) (v_ArrVal_4878 (Array Int Int)) (v_ArrVal_4881 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_349| 4) |c_~#queue~0.offset|) v_ArrVal_4877)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4878))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_4879) .cse3 v_ArrVal_4881)) |c_~#stored_elements~0.base| v_ArrVal_4883) |c_~#queue~0.base|)) (.cse5 (select .cse0 .cse3))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4879) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_349| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| (select .cse4 .cse3))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_348| 4)) v_ArrVal_4885) .cse1) 2147483647) (= 400 .cse5) (< (+ .cse5 1) v_ArrVal_4881))))))) is different from false [2022-11-20 21:01:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:01:26,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759508374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:26,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [248701233] [2022-11-20 21:01:26,336 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:26,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:26,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-20 21:01:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945473288] [2022-11-20 21:01:26,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:26,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 21:01:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 21:01:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=823, Unknown=29, NotChecked=198, Total=1332 [2022-11-20 21:01:26,339 INFO L87 Difference]: Start difference. First operand 505 states and 1042 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:26,819 INFO L93 Difference]: Finished difference Result 541 states and 1107 transitions. [2022-11-20 21:01:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 21:01:26,819 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:01:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:26,820 INFO L225 Difference]: With dead ends: 541 [2022-11-20 21:01:26,820 INFO L226 Difference]: Without dead ends: 541 [2022-11-20 21:01:26,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=366, Invalid=1023, Unknown=29, NotChecked=222, Total=1640 [2022-11-20 21:01:26,821 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:26,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 226 Unchecked, 0.1s Time] [2022-11-20 21:01:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-20 21:01:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 499. [2022-11-20 21:01:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 483 states have (on average 2.132505175983437) internal successors, (1030), 498 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1030 transitions. [2022-11-20 21:01:26,828 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1030 transitions. Word has length 19 [2022-11-20 21:01:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:26,828 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 1030 transitions. [2022-11-20 21:01:26,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1030 transitions. [2022-11-20 21:01:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 21:01:26,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:26,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:26,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:27,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-20 21:01:27,030 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 730566026, now seen corresponding path program 14 times [2022-11-20 21:01:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:27,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825243458] [2022-11-20 21:01:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:28,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825243458] [2022-11-20 21:01:28,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825243458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:28,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154160712] [2022-11-20 21:01:28,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:01:28,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:28,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:28,528 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:28,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-20 21:01:28,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:01:28,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:28,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-20 21:01:28,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:28,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:28,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:28,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 21:01:29,000 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-20 21:01:29,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-20 21:01:29,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:29,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 21:01:29,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 21:01:29,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:01:29,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:30,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:01:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:01:30,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:34,843 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| Int) (v_ArrVal_4988 Int) (v_ArrVal_4984 Int) (v_ArrVal_4986 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_4984)) |c_~#stored_elements~0.base| v_ArrVal_4986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| 4) |c_~#queue~0.offset|) v_ArrVal_4988) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4984) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-20 21:01:35,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| Int) (v_ArrVal_4988 Int) (v_ArrVal_4984 Int) (v_ArrVal_4986 (Array Int Int)) (v_ArrVal_4982 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4982) .cse2 v_ArrVal_4984)) |c_~#stored_elements~0.base| v_ArrVal_4986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4982) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4984) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| 4) |c_~#queue~0.offset|) v_ArrVal_4988) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-20 21:01:35,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| Int) (v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4988 Int) (v_ArrVal_4984 Int) (v_ArrVal_4986 (Array Int Int)) (v_ArrVal_4982 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4981))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_4982) .cse2 v_ArrVal_4984)) |c_~#stored_elements~0.base| v_ArrVal_4986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4982) (< (+ 1 (select .cse0 .cse2)) v_ArrVal_4984) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| 4) |c_~#queue~0.offset|) v_ArrVal_4988) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-20 21:01:35,196 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| Int) (v_ArrVal_4979 Int) (v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4988 Int) (v_ArrVal_4984 Int) (v_ArrVal_4986 (Array Int Int)) (v_ArrVal_4982 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_4979)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4981))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_4982) .cse3 v_ArrVal_4984)) |c_~#stored_elements~0.base| v_ArrVal_4986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| 4) |c_~#queue~0.offset|) v_ArrVal_4988) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_4982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_4984)))))) is different from false [2022-11-20 21:01:35,232 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_354| Int) (v_ArrVal_4979 Int) (v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4988 Int) (v_ArrVal_4984 Int) (v_ArrVal_4986 (Array Int Int)) (v_ArrVal_4982 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_354| 4)) v_ArrVal_4979)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_4981))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_4982) .cse1 v_ArrVal_4984)) |c_~#stored_elements~0.base| v_ArrVal_4986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_4984) (< (+ (select .cse0 .cse2) 1) v_ArrVal_4982) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| 4) |c_~#queue~0.offset|) v_ArrVal_4988) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_353| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_354| (select .cse4 .cse1))))))))) is different from false [2022-11-20 21:01:35,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 21:01:35,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154160712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:35,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1030569710] [2022-11-20 21:01:35,341 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:35,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:35,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 35 [2022-11-20 21:01:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612842817] [2022-11-20 21:01:35,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:35,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 21:01:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:35,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 21:01:35,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=761, Unknown=17, NotChecked=320, Total=1332 [2022-11-20 21:01:35,343 INFO L87 Difference]: Start difference. First operand 499 states and 1030 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:36,524 INFO L93 Difference]: Finished difference Result 519 states and 1071 transitions. [2022-11-20 21:01:36,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:01:36,524 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 21:01:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:36,525 INFO L225 Difference]: With dead ends: 519 [2022-11-20 21:01:36,525 INFO L226 Difference]: Without dead ends: 519 [2022-11-20 21:01:36,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=369, Invalid=1116, Unknown=17, NotChecked=390, Total=1892 [2022-11-20 21:01:36,526 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 390 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:36,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 390 Unchecked, 0.2s Time] [2022-11-20 21:01:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-20 21:01:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2022-11-20 21:01:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 471 states have (on average 2.150743099787686) internal successors, (1013), 486 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1013 transitions. [2022-11-20 21:01:36,533 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1013 transitions. Word has length 19 [2022-11-20 21:01:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:36,533 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 1013 transitions. [2022-11-20 21:01:36,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1013 transitions. [2022-11-20 21:01:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:01:36,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:36,534 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:36,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:36,734 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash 31655780, now seen corresponding path program 1 times [2022-11-20 21:01:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:36,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600566289] [2022-11-20 21:01:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:37,394 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-20 21:01:37,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600566289] [2022-11-20 21:01:37,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600566289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5363399] [2022-11-20 21:01:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:37,396 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:37,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-20 21:01:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:37,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-20 21:01:37,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:37,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:37,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:37,798 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:37,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:37,822 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:37,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:37,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 21:01:38,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-20 21:01:38,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-20 21:01:38,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-20 21:01:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:38,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-20 21:01:38,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-11-20 21:01:38,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-11-20 21:01:38,613 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-20 21:01:38,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:38,877 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5095 Int) (v_ArrVal_5093 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5093) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_5095)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:38,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_5095 Int) (v_ArrVal_5093 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_5093) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_5095)) .cse2)) 2147483647))))) is different from false [2022-11-20 21:01:38,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_5095 Int) (v_ArrVal_5093 (Array Int Int)) (v_ArrVal_5089 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5089) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5093) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5095)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-20 21:01:38,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5095 Int) (v_ArrVal_5093 (Array Int Int)) (v_ArrVal_5089 Int) (v_ArrVal_5087 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5087)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5089) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5093) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5095)) .cse1)) 2147483647) (= 400 .cse4))))) is different from false [2022-11-20 21:01:39,208 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-20 21:01:39,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5363399] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:39,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495769772] [2022-11-20 21:01:39,209 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:39,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:39,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:01:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071666276] [2022-11-20 21:01:39,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:39,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:01:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:01:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=613, Unknown=21, NotChecked=228, Total=1056 [2022-11-20 21:01:39,211 INFO L87 Difference]: Start difference. First operand 487 states and 1013 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:39,864 INFO L93 Difference]: Finished difference Result 624 states and 1246 transitions. [2022-11-20 21:01:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:01:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:01:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:39,865 INFO L225 Difference]: With dead ends: 624 [2022-11-20 21:01:39,865 INFO L226 Difference]: Without dead ends: 624 [2022-11-20 21:01:39,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=252, Invalid=735, Unknown=21, NotChecked=252, Total=1260 [2022-11-20 21:01:39,866 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:39,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 67 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 246 Invalid, 0 Unknown, 672 Unchecked, 0.3s Time] [2022-11-20 21:01:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-20 21:01:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 567. [2022-11-20 21:01:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 551 states have (on average 2.0961887477313974) internal successors, (1155), 566 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1155 transitions. [2022-11-20 21:01:39,874 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1155 transitions. Word has length 20 [2022-11-20 21:01:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:39,874 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 1155 transitions. [2022-11-20 21:01:39,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1155 transitions. [2022-11-20 21:01:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:01:39,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:39,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:39,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-11-20 21:01:40,076 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash -692472446, now seen corresponding path program 2 times [2022-11-20 21:01:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:40,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181943433] [2022-11-20 21:01:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:40,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:40,970 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-20 21:01:40,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:40,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181943433] [2022-11-20 21:01:40,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181943433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843949495] [2022-11-20 21:01:40,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:01:40,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:40,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:40,972 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:40,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-20 21:01:41,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:01:41,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:41,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-20 21:01:41,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:41,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 treesize of output 34 [2022-11-20 21:01:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:41,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:41,411 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:41,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-20 21:01:41,441 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-20 21:01:41,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-20 21:01:41,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 21:01:41,658 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 21:01:41,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-20 21:01:41,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:41,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 21:01:41,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:01:41,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-20 21:01:41,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:41,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 21:01:42,082 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 21:01:42,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-20 21:01:42,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 21:01:42,143 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-20 21:01:42,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:42,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5197 (Array Int Int)) (v_ArrVal_5199 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5197) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5199)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:42,293 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5197 (Array Int Int)) (v_ArrVal_5199 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5197) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5199)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:42,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_5197 (Array Int Int)) (v_ArrVal_5193 Int) (v_ArrVal_5199 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5193) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5197) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5199)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-20 21:01:42,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5197 (Array Int Int)) (v_ArrVal_5193 Int) (v_ArrVal_5192 (Array Int Int)) (v_ArrVal_5199 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5192))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5193) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_5197) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5199)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:01:42,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5197 (Array Int Int)) (v_ArrVal_5193 Int) (v_ArrVal_5191 Int) (v_ArrVal_5192 (Array Int Int)) (v_ArrVal_5199 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5191)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5192))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5193) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_5197) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_5199)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:01:42,745 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-20 21:01:42,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843949495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:42,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [124272841] [2022-11-20 21:01:42,746 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:42,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:42,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 30 [2022-11-20 21:01:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495020186] [2022-11-20 21:01:42,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:42,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:01:42,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:42,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:01:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=515, Unknown=15, NotChecked=270, Total=992 [2022-11-20 21:01:42,748 INFO L87 Difference]: Start difference. First operand 567 states and 1155 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:44,228 INFO L93 Difference]: Finished difference Result 914 states and 1849 transitions. [2022-11-20 21:01:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 21:01:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:01:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:44,230 INFO L225 Difference]: With dead ends: 914 [2022-11-20 21:01:44,230 INFO L226 Difference]: Without dead ends: 914 [2022-11-20 21:01:44,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=438, Invalid=1045, Unknown=19, NotChecked=390, Total=1892 [2022-11-20 21:01:44,231 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 309 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 713 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:44,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 65 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 546 Invalid, 0 Unknown, 713 Unchecked, 0.6s Time] [2022-11-20 21:01:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-11-20 21:01:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 520. [2022-11-20 21:01:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 504 states have (on average 2.107142857142857) internal successors, (1062), 519 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1062 transitions. [2022-11-20 21:01:44,242 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1062 transitions. Word has length 20 [2022-11-20 21:01:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:44,242 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1062 transitions. [2022-11-20 21:01:44,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1062 transitions. [2022-11-20 21:01:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:01:44,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:44,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:44,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-11-20 21:01:44,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-20 21:01:44,451 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash 576810242, now seen corresponding path program 3 times [2022-11-20 21:01:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:44,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985848799] [2022-11-20 21:01:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:45,214 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-20 21:01:45,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985848799] [2022-11-20 21:01:45,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985848799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253436388] [2022-11-20 21:01:45,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:01:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:45,216 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:45,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-11-20 21:01:45,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:01:45,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:45,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 21:01:45,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:45,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:45,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:45,631 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:45,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:45,655 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:45,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:45,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:45,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:01:46,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 21:01:46,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:01:46,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:46,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:01:46,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-20 21:01:46,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-20 21:01:46,663 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-20 21:01:46,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:46,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5305 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5306)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:46,794 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5305 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5306)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:46,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5305 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5306)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:46,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_5306 Int) (v_ArrVal_5305 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5306)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-20 21:01:46,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5305 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5302))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_5306)) .cse2)) 2147483647)))))) is different from false [2022-11-20 21:01:46,853 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5305 (Array Int Int)) (v_ArrVal_5300 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5300)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5302))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5306)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:01:46,888 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5306 Int) (v_ArrVal_5302 (Array Int Int)) (v_ArrVal_5305 (Array Int Int)) (v_ArrVal_5300 Int) (v_ArrVal_5298 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5298) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5300)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5302))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_5305) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5306)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:01:47,056 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-20 21:01:47,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253436388] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [349693911] [2022-11-20 21:01:47,057 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:47,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:47,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:01:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413896425] [2022-11-20 21:01:47,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:47,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:01:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:01:47,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=493, Unknown=7, NotChecked=378, Total=1056 [2022-11-20 21:01:47,063 INFO L87 Difference]: Start difference. First operand 520 states and 1062 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:49,752 INFO L93 Difference]: Finished difference Result 536 states and 1096 transitions. [2022-11-20 21:01:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 21:01:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:01:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:49,753 INFO L225 Difference]: With dead ends: 536 [2022-11-20 21:01:49,754 INFO L226 Difference]: Without dead ends: 536 [2022-11-20 21:01:49,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=255, Invalid=696, Unknown=7, NotChecked=448, Total=1406 [2022-11-20 21:01:49,754 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 379 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:49,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 379 Unchecked, 0.1s Time] [2022-11-20 21:01:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-11-20 21:01:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 530. [2022-11-20 21:01:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 514 states have (on average 2.1089494163424125) internal successors, (1084), 529 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1084 transitions. [2022-11-20 21:01:49,762 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1084 transitions. Word has length 20 [2022-11-20 21:01:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:49,762 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 1084 transitions. [2022-11-20 21:01:49,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1084 transitions. [2022-11-20 21:01:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:01:49,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:49,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:49,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:49,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:49,964 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1832949804, now seen corresponding path program 4 times [2022-11-20 21:01:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409177239] [2022-11-20 21:01:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:50,988 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-20 21:01:50,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:50,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409177239] [2022-11-20 21:01:50,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409177239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:50,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749335546] [2022-11-20 21:01:50,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:01:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:50,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:50,990 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:50,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-11-20 21:01:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:51,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 21:01:51,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:51,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:51,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:51,440 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:51,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:51,466 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:51,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:51,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:51,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:01:51,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 21:01:52,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:01:52,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:52,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:01:52,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-20 21:01:52,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-20 21:01:52,559 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-20 21:01:52,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:52,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5415 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5413) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5415)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:52,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5415 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5410))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_5413) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5415)) .cse1)) 2147483647)) is different from false [2022-11-20 21:01:52,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0)) (forall ((v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5415 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5410))) (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 .cse0 (+ (select .cse4 .cse0) 1))))) |c_~#stored_elements~0.base| v_ArrVal_5413) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_5415)) .cse2)) 2147483647)))) is different from false [2022-11-20 21:01:52,899 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_5408 Int) (v_ArrVal_5410 (Array Int Int)) (v_ArrVal_5413 (Array Int Int)) (v_ArrVal_5415 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5408)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5410))) (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_5413) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5415)) .cse1)) 2147483647)) (= 400 (select .cse5 .cse4)))) is different from false [2022-11-20 21:01:53,337 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-20 21:01:53,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749335546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:01:53,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [325698472] [2022-11-20 21:01:53,338 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:01:53,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:01:53,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:01:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475593829] [2022-11-20 21:01:53,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:01:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:01:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:01:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:01:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=613, Unknown=19, NotChecked=228, Total=1056 [2022-11-20 21:01:53,340 INFO L87 Difference]: Start difference. First operand 530 states and 1084 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:01:54,814 INFO L93 Difference]: Finished difference Result 671 states and 1321 transitions. [2022-11-20 21:01:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 21:01:54,815 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:01:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:01:54,816 INFO L225 Difference]: With dead ends: 671 [2022-11-20 21:01:54,816 INFO L226 Difference]: Without dead ends: 671 [2022-11-20 21:01:54,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=394, Invalid=1163, Unknown=19, NotChecked=316, Total=1892 [2022-11-20 21:01:54,817 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:01:54,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 72 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 309 Invalid, 0 Unknown, 1046 Unchecked, 0.4s Time] [2022-11-20 21:01:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-11-20 21:01:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 551. [2022-11-20 21:01:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 535 states have (on average 2.095327102803738) internal successors, (1121), 550 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1121 transitions. [2022-11-20 21:01:54,825 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1121 transitions. Word has length 20 [2022-11-20 21:01:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:01:54,825 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 1121 transitions. [2022-11-20 21:01:54,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:01:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1121 transitions. [2022-11-20 21:01:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:01:54,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:01:54,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:01:54,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-11-20 21:01:55,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:55,027 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:01:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:01:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1999023912, now seen corresponding path program 5 times [2022-11-20 21:01:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:01:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445404085] [2022-11-20 21:01:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:01:55,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:01:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:01:56,249 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-20 21:01:56,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:01:56,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445404085] [2022-11-20 21:01:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445404085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:01:56,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506146813] [2022-11-20 21:01:56,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:01:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:01:56,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:01:56,251 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:01:56,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-11-20 21:01:56,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:01:56,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:01:56,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-20 21:01:56,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:01:56,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:56,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:56,720 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:01:56,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:01:56,750 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:01:56,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:01:56,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:01:57,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:01:57,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:01:57,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:57,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:01:57,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:01:57,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:01:57,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:01:58,278 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-20 21:01:58,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:01:58,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5521 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| Int) (v_ArrVal_5522 (Array Int Int)) (v_ArrVal_5524 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5521) |c_~#stored_elements~0.base| v_ArrVal_5522) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_5524) .cse1) 2147483647)))) is different from false [2022-11-20 21:01:58,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5519 Int) (v_ArrVal_5521 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| Int) (v_ArrVal_5522 (Array Int Int)) (v_ArrVal_5524 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_5519)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5521) |c_~#stored_elements~0.base| v_ArrVal_5522) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_378| 4) |c_~#queue~0.offset|) v_ArrVal_5524) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_5519))))) is different from false [2022-11-20 21:02:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:02:06,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506146813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648315302] [2022-11-20 21:02:06,518 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:02:06,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:06,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-20 21:02:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912136328] [2022-11-20 21:02:06,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:02:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:02:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=647, Unknown=23, NotChecked=114, Total=992 [2022-11-20 21:02:06,520 INFO L87 Difference]: Start difference. First operand 551 states and 1121 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:07,172 INFO L93 Difference]: Finished difference Result 567 states and 1156 transitions. [2022-11-20 21:02:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 21:02:07,172 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:07,174 INFO L225 Difference]: With dead ends: 567 [2022-11-20 21:02:07,174 INFO L226 Difference]: Without dead ends: 567 [2022-11-20 21:02:07,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=297, Invalid=878, Unknown=23, NotChecked=134, Total=1332 [2022-11-20 21:02:07,175 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:07,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 461 Unchecked, 0.1s Time] [2022-11-20 21:02:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-20 21:02:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 558. [2022-11-20 21:02:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 542 states have (on average 2.0996309963099633) internal successors, (1138), 557 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1138 transitions. [2022-11-20 21:02:07,183 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1138 transitions. Word has length 20 [2022-11-20 21:02:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:07,183 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1138 transitions. [2022-11-20 21:02:07,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1138 transitions. [2022-11-20 21:02:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:07,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:07,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:07,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:07,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:07,390 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1999023926, now seen corresponding path program 1 times [2022-11-20 21:02:07,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521508788] [2022-11-20 21:02:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:07,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:07,974 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-20 21:02:07,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521508788] [2022-11-20 21:02:07,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521508788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:07,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790497956] [2022-11-20 21:02:07,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:07,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:07,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:07,976 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:07,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-11-20 21:02:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:08,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 21:02:08,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:08,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:08,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:08,400 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:08,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:08,425 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:08,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:08,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:08,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:08,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:02:09,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:02:09,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:09,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:02:09,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-20 21:02:09,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 21:02:09,533 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-20 21:02:09,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:09,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array Int Int)) (v_ArrVal_5632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5631) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| 4) |c_~#queue~0.offset|) v_ArrVal_5632) .cse1) 2147483649)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| (select .cse0 .cse1)))))) is different from false [2022-11-20 21:02:09,712 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array Int Int)) (v_ArrVal_5630 (Array Int Int)) (v_ArrVal_5632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5630) |c_~#stored_elements~0.base| v_ArrVal_5631) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| (select .cse0 .cse1))) (<= 0 (+ 2147483649 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| 4) |c_~#queue~0.offset|) v_ArrVal_5632) .cse1)))))) is different from false [2022-11-20 21:02:09,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array Int Int)) (v_ArrVal_5630 (Array Int Int)) (v_ArrVal_5632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5630) |c_~#stored_elements~0.base| v_ArrVal_5631) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ 2147483649 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| 4) |c_~#queue~0.offset|) v_ArrVal_5632) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| (select .cse0 .cse1)))))) is different from false [2022-11-20 21:02:09,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array Int Int)) (v_ArrVal_5630 (Array Int Int)) (v_ArrVal_5632 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5630) |c_~#stored_elements~0.base| v_ArrVal_5631) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ 2147483649 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| 4) |c_~#queue~0.offset|) v_ArrVal_5632) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_383| (select .cse0 .cse1)))))) is different from false [2022-11-20 21:02:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:02:10,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790497956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:10,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [293228593] [2022-11-20 21:02:10,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-20 21:02:10,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:10,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-11-20 21:02:10,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826195957] [2022-11-20 21:02:10,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:10,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 21:02:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 21:02:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=470, Unknown=15, NotChecked=196, Total=812 [2022-11-20 21:02:10,362 INFO L87 Difference]: Start difference. First operand 558 states and 1138 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:15,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:15,470 INFO L93 Difference]: Finished difference Result 652 states and 1300 transitions. [2022-11-20 21:02:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 21:02:15,470 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:15,471 INFO L225 Difference]: With dead ends: 652 [2022-11-20 21:02:15,472 INFO L226 Difference]: Without dead ends: 652 [2022-11-20 21:02:15,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=294, Invalid=1038, Unknown=16, NotChecked=292, Total=1640 [2022-11-20 21:02:15,472 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:15,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 472 Unchecked, 0.1s Time] [2022-11-20 21:02:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-20 21:02:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 558. [2022-11-20 21:02:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 542 states have (on average 2.0977859778597785) internal successors, (1137), 557 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1137 transitions. [2022-11-20 21:02:15,481 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1137 transitions. Word has length 20 [2022-11-20 21:02:15,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:15,481 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1137 transitions. [2022-11-20 21:02:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1137 transitions. [2022-11-20 21:02:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:15,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:15,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:15,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-11-20 21:02:15,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-11-20 21:02:15,684 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -223991014, now seen corresponding path program 6 times [2022-11-20 21:02:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:15,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122914887] [2022-11-20 21:02:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:16,700 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-20 21:02:16,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:16,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122914887] [2022-11-20 21:02:16,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122914887] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:16,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186969780] [2022-11-20 21:02:16,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:02:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:16,701 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:16,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-11-20 21:02:17,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:02:17,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:02:17,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 21:02:17,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:17,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:17,137 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:17,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:17,162 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:17,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:17,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:17,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:17,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:02:17,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:17,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:02:17,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:02:17,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-20 21:02:17,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-20 21:02:18,071 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-20 21:02:18,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:18,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5740 Int) (v_ArrVal_5739 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5739) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5740)) .cse1)) 2147483647)) is different from false [2022-11-20 21:02:18,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5740 Int) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5738) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5739) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5740)) .cse1)) 2147483647)) is different from false [2022-11-20 21:02:18,209 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5740 Int) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5738) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5739) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5740)) .cse1)) 2147483647)) is different from false [2022-11-20 21:02:18,318 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_5740 Int) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5738) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5739) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5740)) .cse1)) 2147483647)) (= 400 .cse4)))) is different from false [2022-11-20 21:02:18,451 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5734 Int) (v_ArrVal_5732 Int) (v_ArrVal_5740 Int) (v_ArrVal_5738 (Array Int Int)) (v_ArrVal_5739 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5732)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5734) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_5738) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5739) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_5740)) .cse1)) 2147483647) (= .cse4 400))))) is different from false [2022-11-20 21:02:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:02:18,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186969780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:18,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1193236907] [2022-11-20 21:02:18,660 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:02:18,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:18,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:02:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171487910] [2022-11-20 21:02:18,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:18,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:02:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:18,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:02:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=589, Unknown=7, NotChecked=280, Total=1056 [2022-11-20 21:02:18,662 INFO L87 Difference]: Start difference. First operand 558 states and 1137 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:19,907 INFO L93 Difference]: Finished difference Result 747 states and 1449 transitions. [2022-11-20 21:02:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 21:02:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:19,909 INFO L225 Difference]: With dead ends: 747 [2022-11-20 21:02:19,909 INFO L226 Difference]: Without dead ends: 747 [2022-11-20 21:02:19,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=338, Invalid=1080, Unknown=8, NotChecked=380, Total=1806 [2022-11-20 21:02:19,910 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 76 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:19,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 85 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 295 Invalid, 0 Unknown, 614 Unchecked, 0.3s Time] [2022-11-20 21:02:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-20 21:02:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 588. [2022-11-20 21:02:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 572 states have (on average 2.1013986013986012) internal successors, (1202), 587 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1202 transitions. [2022-11-20 21:02:19,919 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1202 transitions. Word has length 20 [2022-11-20 21:02:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:19,919 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 1202 transitions. [2022-11-20 21:02:19,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1202 transitions. [2022-11-20 21:02:19,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:19,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:19,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:19,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:20,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:20,122 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -223991000, now seen corresponding path program 2 times [2022-11-20 21:02:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347096322] [2022-11-20 21:02:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:20,797 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-20 21:02:20,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:20,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347096322] [2022-11-20 21:02:20,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347096322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:20,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038259139] [2022-11-20 21:02:20,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:02:20,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:20,799 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:20,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-11-20 21:02:21,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:02:21,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:02:21,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 21:02:21,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:21,252 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 21:02:21,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 21:02:21,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 21:02:21,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:21,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:02:21,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 21:02:21,649 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 21:02:21,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-20 21:02:21,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-20 21:02:21,721 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-20 21:02:21,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:21,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_5830 (Array Int Int)) (v_ArrVal_5831 Int)) (or (< (+ v_ArrVal_5831 2147483648) 0) (<= 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5830) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_5831) (+ |c_~#queue~0.offset| 1604)) 2147483649)))) is different from false [2022-11-20 21:02:21,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5829 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_5830 (Array Int Int)) (v_ArrVal_5831 Int)) (or (< (+ v_ArrVal_5831 2147483648) 0) (<= 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5829) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5830) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_5831) (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-11-20 21:02:21,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:02:21,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-20 21:02:21,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:02:21,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 215 [2022-11-20 21:02:21,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 115 [2022-11-20 21:02:21,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2022-11-20 21:02:21,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 21:02:22,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 21:02:22,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 192 [2022-11-20 21:02:22,259 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-20 21:02:22,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038259139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:22,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643733095] [2022-11-20 21:02:22,260 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:02:22,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:22,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-11-20 21:02:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160469111] [2022-11-20 21:02:22,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:22,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 21:02:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:22,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 21:02:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=348, Unknown=2, NotChecked=78, Total=506 [2022-11-20 21:02:22,261 INFO L87 Difference]: Start difference. First operand 588 states and 1202 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:23,003 INFO L93 Difference]: Finished difference Result 1104 states and 2232 transitions. [2022-11-20 21:02:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:02:23,004 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:23,005 INFO L225 Difference]: With dead ends: 1104 [2022-11-20 21:02:23,005 INFO L226 Difference]: Without dead ends: 1104 [2022-11-20 21:02:23,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=491, Unknown=2, NotChecked=98, Total=756 [2022-11-20 21:02:23,006 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 651 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:23,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 24 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 211 Invalid, 0 Unknown, 328 Unchecked, 0.4s Time] [2022-11-20 21:02:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-11-20 21:02:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 549. [2022-11-20 21:02:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:02:23,019 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:02:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:23,020 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:02:23,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:02:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:23,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:23,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:23,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-11-20 21:02:23,229 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:23,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1491379462, now seen corresponding path program 7 times [2022-11-20 21:02:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:23,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577897121] [2022-11-20 21:02:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:24,129 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-20 21:02:24,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:24,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577897121] [2022-11-20 21:02:24,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577897121] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:24,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156905975] [2022-11-20 21:02:24,129 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:02:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:24,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:24,130 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:24,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-11-20 21:02:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:24,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 21:02:24,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:24,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:24,571 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:24,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:24,594 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:24,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:24,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:24,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:25,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:02:25,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:25,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:02:25,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2022-11-20 21:02:25,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-11-20 21:02:25,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:02:25,794 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-20 21:02:25,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:26,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5939 (Array Int Int)) (v_ArrVal_5940 Int) (v_ArrVal_5938 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5938))) (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5939) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* (select (select .cse0 |c_~#queue~0.base|) .cse1) 4)) v_ArrVal_5940)) .cse1)) 2147483647)) is different from false [2022-11-20 21:02:26,219 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5937 Int) (v_ArrVal_5939 (Array Int Int)) (v_ArrVal_5940 Int) (v_ArrVal_5938 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_5937)) |c_~#stored_elements~0.base| v_ArrVal_5938))) (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_5939) |c_~#queue~0.base|) (+ (* (select (select .cse0 |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5940)) .cse1)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_5937)))) is different from false [2022-11-20 21:02:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:02:32,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156905975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:32,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442313867] [2022-11-20 21:02:32,313 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:02:32,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:32,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-20 21:02:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126379914] [2022-11-20 21:02:32,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:32,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:02:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:02:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=665, Unknown=36, NotChecked=114, Total=992 [2022-11-20 21:02:32,316 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:33,104 INFO L93 Difference]: Finished difference Result 715 states and 1395 transitions. [2022-11-20 21:02:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 21:02:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:33,105 INFO L225 Difference]: With dead ends: 715 [2022-11-20 21:02:33,106 INFO L226 Difference]: Without dead ends: 715 [2022-11-20 21:02:33,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=267, Invalid=963, Unknown=38, NotChecked=138, Total=1406 [2022-11-20 21:02:33,106 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:33,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 63 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 654 Unchecked, 0.2s Time] [2022-11-20 21:02:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-20 21:02:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 549. [2022-11-20 21:02:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:02:33,117 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:02:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:33,117 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:02:33,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:02:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:33,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:33,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:33,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:33,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-11-20 21:02:33,327 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1562495948, now seen corresponding path program 8 times [2022-11-20 21:02:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:33,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998676226] [2022-11-20 21:02:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:34,280 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-20 21:02:34,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998676226] [2022-11-20 21:02:34,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998676226] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184309115] [2022-11-20 21:02:34,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:02:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:34,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:34,283 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:34,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-11-20 21:02:34,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:02:34,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:02:34,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-20 21:02:34,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:34,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:34,798 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:34,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:34,835 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:35,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:35,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:35,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:02:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:35,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:02:35,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:02:35,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 21:02:36,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:02:36,277 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-20 21:02:36,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:36,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6043 Int) (v_ArrVal_6046 (Array Int Int)) (v_ArrVal_6049 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| Int) (v_ArrVal_6047 Int) (v_ArrVal_6045 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6043) .cse4 v_ArrVal_6045)) |c_~#stored_elements~0.base| v_ArrVal_6046))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| 4) |c_~#queue~0.offset|) v_ArrVal_6047)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6049) |c_~#queue~0.base|) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_6045) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| (select .cse1 .cse2)))))))) is different from false [2022-11-20 21:02:37,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6043 Int) (v_ArrVal_6041 Int) (v_ArrVal_6046 (Array Int Int)) (v_ArrVal_6049 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| Int) (v_ArrVal_6047 Int) (v_ArrVal_6045 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6041)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6043) .cse1 v_ArrVal_6045)) |c_~#stored_elements~0.base| v_ArrVal_6046))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_6045) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| 4) |c_~#queue~0.offset|) v_ArrVal_6047)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6049) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_402| (select .cse3 .cse4)))))))) is different from false [2022-11-20 21:02:45,365 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-20 21:02:45,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184309115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:45,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366342824] [2022-11-20 21:02:45,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-20 21:02:45,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:45,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-20 21:02:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529477007] [2022-11-20 21:02:45,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:45,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:02:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:02:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=652, Unknown=30, NotChecked=114, Total=992 [2022-11-20 21:02:45,367 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:46,130 INFO L93 Difference]: Finished difference Result 662 states and 1311 transitions. [2022-11-20 21:02:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:02:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:46,132 INFO L225 Difference]: With dead ends: 662 [2022-11-20 21:02:46,132 INFO L226 Difference]: Without dead ends: 662 [2022-11-20 21:02:46,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=291, Invalid=809, Unknown=30, NotChecked=130, Total=1260 [2022-11-20 21:02:46,132 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:46,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 82 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 325 Invalid, 0 Unknown, 602 Unchecked, 0.4s Time] [2022-11-20 21:02:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-11-20 21:02:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 549. [2022-11-20 21:02:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:02:46,139 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:02:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:46,140 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:02:46,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:02:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:46,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:46,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:46,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:46,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-11-20 21:02:46,342 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1564341068, now seen corresponding path program 9 times [2022-11-20 21:02:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:46,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596738419] [2022-11-20 21:02:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:47,065 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-20 21:02:47,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:47,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596738419] [2022-11-20 21:02:47,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596738419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:47,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932745001] [2022-11-20 21:02:47,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:02:47,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:47,067 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:47,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-11-20 21:02:47,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:02:47,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:02:47,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 21:02:47,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:47,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:47,516 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:47,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:47,541 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:47,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:47,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:47,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:47,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:02:48,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:48,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:02:48,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:02:48,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:02:48,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 21:02:48,973 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-20 21:02:48,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:49,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6158 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6158)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6160) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-20 21:02:49,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6158 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| Int) (v_ArrVal_6156 Int) (v_ArrVal_6154 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_6154)) |c_~#stored_elements~0.base| v_ArrVal_6155))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= v_ArrVal_6154 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| 4)) v_ArrVal_6156) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6158)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6160) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-11-20 21:02:49,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6158 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| Int) (v_ArrVal_6156 Int) (v_ArrVal_6154 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_6154)) |c_~#stored_elements~0.base| v_ArrVal_6155))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| 4)) v_ArrVal_6156) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6158)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6160) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_6154)))))) is different from false [2022-11-20 21:02:49,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6152 Int) (v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6158 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| Int) (v_ArrVal_6156 Int) (v_ArrVal_6154 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6152) .cse4 v_ArrVal_6154)) |c_~#stored_elements~0.base| v_ArrVal_6155))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| 4)) v_ArrVal_6156) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6158)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6160) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_6154)))))) is different from false [2022-11-20 21:02:49,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6155 (Array Int Int)) (v_ArrVal_6152 Int) (v_ArrVal_6149 Int) (v_ArrVal_6160 (Array Int Int)) (v_ArrVal_6158 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| Int) (v_ArrVal_6156 Int) (v_ArrVal_6154 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6149)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6152) .cse4 v_ArrVal_6154)) |c_~#stored_elements~0.base| v_ArrVal_6155))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| 4)) v_ArrVal_6156) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6158)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6160) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_407| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_6154)))))) is different from false [2022-11-20 21:02:54,442 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-20 21:02:54,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932745001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:02:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [609021488] [2022-11-20 21:02:54,443 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:02:54,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:02:54,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:02:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883628614] [2022-11-20 21:02:54,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:02:54,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:02:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:02:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:02:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=533, Unknown=20, NotChecked=280, Total=1056 [2022-11-20 21:02:54,446 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:02:55,248 INFO L93 Difference]: Finished difference Result 648 states and 1286 transitions. [2022-11-20 21:02:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:02:55,249 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:02:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:02:55,250 INFO L225 Difference]: With dead ends: 648 [2022-11-20 21:02:55,250 INFO L226 Difference]: Without dead ends: 648 [2022-11-20 21:02:55,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=20, NotChecked=310, Total=1260 [2022-11-20 21:02:55,251 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 116 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:02:55,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 70 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 225 Invalid, 0 Unknown, 782 Unchecked, 0.2s Time] [2022-11-20 21:02:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-11-20 21:02:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 549. [2022-11-20 21:02:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:02:55,261 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:02:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:02:55,262 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:02:55,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:02:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:02:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:02:55,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:02:55,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:02:55,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-11-20 21:02:55,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:55,471 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:02:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:02:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1564394078, now seen corresponding path program 10 times [2022-11-20 21:02:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:02:55,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488802534] [2022-11-20 21:02:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:02:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:02:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:56,410 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-20 21:02:56,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:02:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488802534] [2022-11-20 21:02:56,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488802534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:02:56,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589685673] [2022-11-20 21:02:56,410 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 21:02:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:02:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:02:56,412 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:02:56,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-11-20 21:02:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:02:56,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 21:02:56,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:02:56,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:56,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:56,866 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:02:56,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:02:56,890 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:02:56,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:02:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:02:57,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:02:57,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:02:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:02:57,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:02:57,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:02:57,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:02:58,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-20 21:02:58,164 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-20 21:02:58,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:02:58,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6269 (Array Int Int)) (v_ArrVal_6267 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-20 21:02:58,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6264 (Array Int Int)) (v_ArrVal_6269 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| Int) (v_ArrVal_6267 Int) (v_ArrVal_6266 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6264))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| 4) |c_~#queue~0.offset|) v_ArrVal_6266) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_~#queue~0.base|) .cse1) 2147483647))))) is different from false [2022-11-20 21:02:58,441 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 Int) (v_ArrVal_6264 (Array Int Int)) (v_ArrVal_6269 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| Int) (v_ArrVal_6267 Int) (v_ArrVal_6266 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_6263)) |c_~#stored_elements~0.base| v_ArrVal_6264))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| 4) |c_~#queue~0.offset|) v_ArrVal_6266) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_~#queue~0.base|) .cse1) 2147483647) (not (<= v_ArrVal_6263 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))) is different from false [2022-11-20 21:02:58,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 Int) (v_ArrVal_6264 (Array Int Int)) (v_ArrVal_6269 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| Int) (v_ArrVal_6267 Int) (v_ArrVal_6266 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_6263)) |c_~#stored_elements~0.base| v_ArrVal_6264))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_6263) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| 4) |c_~#queue~0.offset|) v_ArrVal_6266) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2022-11-20 21:02:58,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 Int) (v_ArrVal_6264 (Array Int Int)) (v_ArrVal_6261 Int) (v_ArrVal_6269 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| Int) (v_ArrVal_6267 Int) (v_ArrVal_6266 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6261) .cse1 v_ArrVal_6263)) |c_~#stored_elements~0.base| v_ArrVal_6264))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_6263) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| 4) |c_~#queue~0.offset|) v_ArrVal_6266) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| (select .cse3 .cse4)))))))) is different from false [2022-11-20 21:02:58,575 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6263 Int) (v_ArrVal_6264 (Array Int Int)) (v_ArrVal_6261 Int) (v_ArrVal_6269 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| Int) (v_ArrVal_6258 Int) (v_ArrVal_6267 Int) (v_ArrVal_6266 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6258)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6261) .cse3 v_ArrVal_6263)) |c_~#stored_elements~0.base| v_ArrVal_6264))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_6263) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_412| 4) |c_~#queue~0.offset|) v_ArrVal_6266) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_6267)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6269) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2022-11-20 21:03:00,797 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-20 21:03:00,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589685673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:03:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [331673588] [2022-11-20 21:03:00,798 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:03:00,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:03:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:03:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98448748] [2022-11-20 21:03:00,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:00,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:03:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:03:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=534, Unknown=8, NotChecked=330, Total=1056 [2022-11-20 21:03:00,800 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:03:02,389 INFO L93 Difference]: Finished difference Result 634 states and 1269 transitions. [2022-11-20 21:03:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 21:03:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:03:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:03:02,391 INFO L225 Difference]: With dead ends: 634 [2022-11-20 21:03:02,391 INFO L226 Difference]: Without dead ends: 634 [2022-11-20 21:03:02,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=330, Invalid=946, Unknown=8, NotChecked=438, Total=1722 [2022-11-20 21:03:02,392 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 76 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:03:02,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 68 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 582 Unchecked, 0.3s Time] [2022-11-20 21:03:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-11-20 21:03:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 549. [2022-11-20 21:03:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:03:02,403 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:03:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:03:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:03:02,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:03:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:03:02,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:03:02,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:03:02,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-11-20 21:03:02,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-11-20 21:03:02,605 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:03:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:03:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1390006058, now seen corresponding path program 11 times [2022-11-20 21:03:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:03:02,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583598113] [2022-11-20 21:03:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:02,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:03:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:03,547 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-20 21:03:03,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:03:03,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583598113] [2022-11-20 21:03:03,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583598113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245852976] [2022-11-20 21:03:03,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:03:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:03:03,551 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:03:03,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-11-20 21:03:04,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:03:04,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:03:04,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 21:03:04,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:03:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:04,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:04,107 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:03:04,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:03:04,134 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:03:04,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:03:04,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:03:04,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:03:04,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:03:04,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:04,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:03:05,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-20 21:03:05,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-20 21:03:05,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-20 21:03:05,441 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-20 21:03:05,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:05,489 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6376 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6376) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-20 21:03:05,671 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6376 (Array Int Int)) (v_ArrVal_6373 (Array Int Int)) (v_ArrVal_6375 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6373))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_6375)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6376) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-20 21:03:05,807 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6376 (Array Int Int)) (v_ArrVal_6373 (Array Int Int)) (v_ArrVal_6375 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6373))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_6375)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6376) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-20 21:03:05,822 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (forall ((v_ArrVal_6376 (Array Int Int)) (v_ArrVal_6373 (Array Int Int)) (v_ArrVal_6375 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_6373))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_6375)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6376) |c_~#queue~0.base|) .cse2)) 2147483647)) (= 400 .cse5)))) is different from false [2022-11-20 21:03:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 21:03:06,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245852976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:03:06,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373490519] [2022-11-20 21:03:06,485 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:03:06,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:03:06,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2022-11-20 21:03:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231159868] [2022-11-20 21:03:06,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:06,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:03:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:06,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:03:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=617, Unknown=21, NotChecked=220, Total=992 [2022-11-20 21:03:06,487 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:03:08,200 INFO L93 Difference]: Finished difference Result 615 states and 1238 transitions. [2022-11-20 21:03:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 21:03:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:03:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:03:08,202 INFO L225 Difference]: With dead ends: 615 [2022-11-20 21:03:08,202 INFO L226 Difference]: Without dead ends: 615 [2022-11-20 21:03:08,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=269, Invalid=1206, Unknown=23, NotChecked=308, Total=1806 [2022-11-20 21:03:08,203 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:03:08,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 70 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 251 Invalid, 0 Unknown, 787 Unchecked, 0.3s Time] [2022-11-20 21:03:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-11-20 21:03:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 549. [2022-11-20 21:03:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 535 states have (on average 2.097196261682243) internal successors, (1122), 548 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1122 transitions. [2022-11-20 21:03:08,212 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1122 transitions. Word has length 20 [2022-11-20 21:03:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:03:08,212 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1122 transitions. [2022-11-20 21:03:08,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1122 transitions. [2022-11-20 21:03:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:03:08,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:03:08,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:03:08,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-11-20 21:03:08,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-11-20 21:03:08,414 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:03:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:03:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash -408331274, now seen corresponding path program 12 times [2022-11-20 21:03:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:03:08,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309406815] [2022-11-20 21:03:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:03:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:09,290 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-20 21:03:09,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:03:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309406815] [2022-11-20 21:03:09,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309406815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215138528] [2022-11-20 21:03:09,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:03:09,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:03:09,292 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:03:09,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-11-20 21:03:09,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:03:09,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:03:09,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 21:03:09,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:03:09,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:09,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:09,815 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:03:09,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:03:09,847 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:03:09,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:03:10,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:03:10,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:03:10,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:03:10,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:10,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:03:10,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:03:10,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:03:11,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:03:11,377 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-20 21:03:11,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:11,543 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| Int) (v_ArrVal_6483 (Array Int Int)) (v_ArrVal_6485 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6483) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| 4) |c_~#queue~0.offset|) v_ArrVal_6485) .cse1) 2147483647)))) is different from false [2022-11-20 21:03:11,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| Int) (v_ArrVal_6483 (Array Int Int)) (v_ArrVal_6485 Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6483) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| 4) |c_~#queue~0.offset|) v_ArrVal_6485) .cse1) 2147483647)))) is different from false [2022-11-20 21:03:12,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6481 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| Int) (v_ArrVal_6478 Int) (v_ArrVal_6476 Int) (v_ArrVal_6483 (Array Int Int)) (v_ArrVal_6485 Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6476)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6478) .cse1 v_ArrVal_6481)) |c_~#stored_elements~0.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6483) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_6481) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| 4) |c_~#queue~0.offset|) v_ArrVal_6485) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_422| (select .cse2 .cse3))))))) is different from false [2022-11-20 21:03:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 21:03:16,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215138528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:03:16,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [932810317] [2022-11-20 21:03:16,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-20 21:03:16,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:03:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-20 21:03:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440772711] [2022-11-20 21:03:16,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:16,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 21:03:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:16,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 21:03:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=594, Unknown=13, NotChecked=168, Total=992 [2022-11-20 21:03:16,508 INFO L87 Difference]: Start difference. First operand 549 states and 1122 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:03:17,055 INFO L93 Difference]: Finished difference Result 568 states and 1161 transitions. [2022-11-20 21:03:17,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:03:17,055 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:03:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:03:17,056 INFO L225 Difference]: With dead ends: 568 [2022-11-20 21:03:17,057 INFO L226 Difference]: Without dead ends: 568 [2022-11-20 21:03:17,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=277, Invalid=778, Unknown=13, NotChecked=192, Total=1260 [2022-11-20 21:03:17,058 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 394 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:03:17,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 55 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 394 Unchecked, 0.1s Time] [2022-11-20 21:03:17,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-20 21:03:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 545. [2022-11-20 21:03:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 531 states have (on average 2.096045197740113) internal successors, (1113), 544 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1113 transitions. [2022-11-20 21:03:17,069 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1113 transitions. Word has length 20 [2022-11-20 21:03:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:03:17,069 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 1113 transitions. [2022-11-20 21:03:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1113 transitions. [2022-11-20 21:03:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:03:17,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:03:17,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:03:17,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-11-20 21:03:17,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:17,279 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:03:17,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:03:17,279 INFO L85 PathProgramCache]: Analyzing trace with hash 701243635, now seen corresponding path program 1 times [2022-11-20 21:03:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:03:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162732982] [2022-11-20 21:03:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:03:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:18,209 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-20 21:03:18,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:03:18,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162732982] [2022-11-20 21:03:18,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162732982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:18,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595791089] [2022-11-20 21:03:18,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:18,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:18,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:03:18,211 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:03:18,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-11-20 21:03:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:18,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-20 21:03:18,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:03:18,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:18,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:18,691 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:03:18,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:03:18,715 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:03:18,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:03:18,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:03:18,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:03:19,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-20 21:03:19,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 21:03:19,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:19,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 21:03:19,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-20 21:03:19,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-20 21:03:19,763 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-20 21:03:19,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:20,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6592 (Array Int Int)) (v_ArrVal_6594 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_6592) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_6594)) .cse1)) 2147483647)) is different from false [2022-11-20 21:03:20,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6589 (Array Int Int)) (v_ArrVal_6592 (Array Int Int)) (v_ArrVal_6594 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6589))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_6592) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_6594)) .cse1)) 2147483647) (= .cse5 400)))))) is different from false [2022-11-20 21:03:20,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6589 (Array Int Int)) (v_ArrVal_6587 Int) (v_ArrVal_6592 (Array Int Int)) (v_ArrVal_6594 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6587)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6589))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_6592) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_6594)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:03:20,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6589 (Array Int Int)) (v_ArrVal_6587 Int) (v_ArrVal_6586 Int) (v_ArrVal_6592 (Array Int Int)) (v_ArrVal_6594 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6586) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6587)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6589))) (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store .cse2 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_6592) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_6594)) .cse1)) 2147483647) (= 400 .cse5)))))) is different from false [2022-11-20 21:03:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 21:03:20,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595791089] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:03:20,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [686292070] [2022-11-20 21:03:20,485 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 21:03:20,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:03:20,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-20 21:03:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592452538] [2022-11-20 21:03:20,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:03:20,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 21:03:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:03:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 21:03:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=615, Unknown=12, NotChecked=228, Total=1056 [2022-11-20 21:03:20,487 INFO L87 Difference]: Start difference. First operand 545 states and 1113 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:03:23,348 INFO L93 Difference]: Finished difference Result 700 states and 1372 transitions. [2022-11-20 21:03:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 21:03:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 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 21 [2022-11-20 21:03:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:03:23,350 INFO L225 Difference]: With dead ends: 700 [2022-11-20 21:03:23,350 INFO L226 Difference]: Without dead ends: 700 [2022-11-20 21:03:23,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=308, Invalid=885, Unknown=13, NotChecked=276, Total=1482 [2022-11-20 21:03:23,350 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 21:03:23,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 709 Unchecked, 0.2s Time] [2022-11-20 21:03:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-11-20 21:03:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 542. [2022-11-20 21:03:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 528 states have (on average 2.0984848484848486) internal successors, (1108), 541 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1108 transitions. [2022-11-20 21:03:23,358 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1108 transitions. Word has length 21 [2022-11-20 21:03:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:03:23,358 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1108 transitions. [2022-11-20 21:03:23,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:03:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1108 transitions. [2022-11-20 21:03:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 21:03:23,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:03:23,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:03:23,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-11-20 21:03:23,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:23,560 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-20 21:03:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:03:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1840194445, now seen corresponding path program 2 times [2022-11-20 21:03:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:03:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357352368] [2022-11-20 21:03:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:03:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:03:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:03:24,851 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-20 21:03:24,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:03:24,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357352368] [2022-11-20 21:03:24,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357352368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:03:24,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326701083] [2022-11-20 21:03:24,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:03:24,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:03:24,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:03:24,853 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:03:24,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fd5cd4-231a-40ca-a80b-a8a332dffe9a/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-11-20 21:03:25,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:03:25,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:03:25,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 21:03:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:03:25,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:25,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:25,395 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 21:03:25,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 21:03:25,426 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 21:03:25,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 21:03:25,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 21:03:25,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 21:03:25,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-20 21:03:26,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:03:26,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 21:03:26,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-20 21:03:26,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-20 21:03:26,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-20 21:03:26,754 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-20 21:03:26,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:03:27,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| Int) (v_ArrVal_6703 Int) (v_ArrVal_6700 (Array Int Int)) (v_ArrVal_6701 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6700) |c_~#stored_elements~0.base| v_ArrVal_6701) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| 4)) v_ArrVal_6703) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| (select .cse0 .cse1)))))) is different from false [2022-11-20 21:03:27,811 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| Int) (v_ArrVal_6703 Int) (v_ArrVal_6700 (Array Int Int)) (v_ArrVal_6701 (Array Int Int)) (v_ArrVal_6698 Int) (v_ArrVal_6696 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_6696) .cse3 v_ArrVal_6698)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_6700) |c_~#stored_elements~0.base| v_ArrVal_6701) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| 4)) v_ArrVal_6703) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_432| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_6698))))) is different from false