./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5e519f3 [2022-11-03 03:48:39,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:48:39,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:48:39,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:48:39,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:48:39,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:48:39,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:48:39,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:48:39,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:48:39,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:48:39,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:48:39,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:48:39,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:48:39,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:48:39,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:48:39,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:48:39,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:48:39,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:48:39,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:48:39,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:48:39,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:48:39,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:48:39,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:48:39,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:48:39,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:48:39,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:48:39,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:48:39,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:48:39,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:48:39,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:48:39,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:48:39,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:48:39,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:48:39,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:48:39,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:48:39,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:48:39,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:48:39,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:48:39,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:48:39,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:48:39,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:48:39,493 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:48:39,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:48:39,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:48:39,535 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:48:39,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:48:39,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:48:39,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:48:39,536 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:48:39,537 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:48:39,537 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:48:39,537 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:48:39,538 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:48:39,538 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:48:39,538 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:48:39,539 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:48:39,539 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:48:39,539 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:48:39,539 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:48:39,540 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:48:39,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:48:39,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:48:39,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:48:39,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:48:39,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:48:39,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:48:39,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:48:39,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:48:39,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:48:39,542 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:48:39,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:48:39,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:48:39,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:48:39,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:48:39,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:48:39,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:48:39,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:48:39,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:48:39,544 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:48:39,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:48:39,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:48:39,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:48:39,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:48:39,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:48:39,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:48:39,546 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_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-03 03:48:39,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:48:39,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:48:39,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:48:39,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:48:39,936 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:48:39,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-03 03:48:40,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/data/713d3771a/ec5660324a804292b1a39700e8d90105/FLAG5f69c4719 [2022-11-03 03:48:40,622 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:48:40,623 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-03 03:48:40,636 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/data/713d3771a/ec5660324a804292b1a39700e8d90105/FLAG5f69c4719 [2022-11-03 03:48:40,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/data/713d3771a/ec5660324a804292b1a39700e8d90105 [2022-11-03 03:48:40,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:48:40,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:48:40,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:48:40,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:48:40,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:48:40,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:48:40" (1/1) ... [2022-11-03 03:48:40,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a12368f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:40, skipping insertion in model container [2022-11-03 03:48:40,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:48:40" (1/1) ... [2022-11-03 03:48:40,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:48:40,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:48:41,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-03 03:48:41,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-03 03:48:41,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:48:41,512 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:48:41,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-03 03:48:41,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-03 03:48:41,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:48:41,636 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:48:41,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41 WrapperNode [2022-11-03 03:48:41,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:48:41,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:48:41,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:48:41,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:48:41,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,712 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-03 03:48:41,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:48:41,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:48:41,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:48:41,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:48:41,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:48:41,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:48:41,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:48:41,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:48:41,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (1/1) ... [2022-11-03 03:48:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:48:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:41,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:48:41,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:48:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 03:48:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 03:48:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 03:48:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:48:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:48:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:48:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:48:41,871 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:48:42,121 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:48:42,123 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:48:42,568 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:48:42,578 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:48:42,578 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 03:48:42,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:48:42 BoogieIcfgContainer [2022-11-03 03:48:42,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:48:42,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:48:42,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:48:42,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:48:42,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:48:40" (1/3) ... [2022-11-03 03:48:42,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134e6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:48:42, skipping insertion in model container [2022-11-03 03:48:42,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:48:41" (2/3) ... [2022-11-03 03:48:42,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134e6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:48:42, skipping insertion in model container [2022-11-03 03:48:42,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:48:42" (3/3) ... [2022-11-03 03:48:42,590 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-03 03:48:42,599 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:48:42,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:48:42,610 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-03 03:48:42,610 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:48:42,705 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 03:48:42,740 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:48:42,754 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-03 03:48:42,757 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 253 transitions, 522 flow [2022-11-03 03:48:42,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 253 transitions, 522 flow [2022-11-03 03:48:42,856 INFO L130 PetriNetUnfolder]: 13/251 cut-off events. [2022-11-03 03:48:42,857 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 03:48:42,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 251 events. 13/251 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-03 03:48:42,877 INFO L118 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-03 03:48:55,699 INFO L133 LiptonReduction]: Checked pairs total: 31637 [2022-11-03 03:48:55,700 INFO L135 LiptonReduction]: Total number of compositions: 244 [2022-11-03 03:48:55,712 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-03 03:48:55,827 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-03 03:48:55,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:48:55,860 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;@9082a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:48:55,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-03 03:48:55,866 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-03 03:48:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:48:55,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:55,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:55,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:48:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1500788054, now seen corresponding path program 1 times [2022-11-03 03:48:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:55,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700216061] [2022-11-03 03:48:55,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:48:57,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:57,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700216061] [2022-11-03 03:48:57,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700216061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:57,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:57,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:48:57,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327671558] [2022-11-03 03:48:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:57,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:48:57,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:48:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:48:57,606 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-03 03:48:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:58,147 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-03 03:48:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:48:58,150 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-03 03:48:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:58,175 INFO L225 Difference]: With dead ends: 1168 [2022-11-03 03:48:58,176 INFO L226 Difference]: Without dead ends: 1168 [2022-11-03 03:48:58,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03 03:48:58,180 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:58,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:48:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-03 03:48:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-03 03:48:58,281 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-03 03:48:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-03 03:48:58,290 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-03 03:48:58,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:58,290 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-03 03:48:58,290 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-03 03:48:58,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-03 03:48:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:48:58,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:58,292 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:48:58,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:48:58,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:48:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 764555353, now seen corresponding path program 1 times [2022-11-03 03:48:58,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:58,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818835797] [2022-11-03 03:48:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:58,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:59,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-03 03:48:59,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:59,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818835797] [2022-11-03 03:48:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818835797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:48:59,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:48:59,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:48:59,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131148937] [2022-11-03 03:48:59,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:48:59,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:48:59,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:48:59,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:48:59,405 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-03 03:49:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:00,125 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-03 03:49:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:00,126 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-03 03:49:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:00,141 INFO L225 Difference]: With dead ends: 1537 [2022-11-03 03:49:00,141 INFO L226 Difference]: Without dead ends: 1537 [2022-11-03 03:49:00,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:49:00,143 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:00,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 31 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 03:49:00,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-03 03:49:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-03 03:49:00,222 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-03 03:49:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:49:00,231 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:49:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:00,232 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:49:00,232 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-03 03:49:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:49:00,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:49:00,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:00,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:00,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:49:00,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 720358963, now seen corresponding path program 2 times [2022-11-03 03:49:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:00,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448383234] [2022-11-03 03:49:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:00,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:00,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448383234] [2022-11-03 03:49:00,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448383234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:00,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:00,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226621096] [2022-11-03 03:49:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:00,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:49:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:00,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:49:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:49:00,871 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-03 03:49:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:01,208 INFO L93 Difference]: Finished difference Result 1712 states and 4512 transitions. [2022-11-03 03:49:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:01,208 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-03 03:49:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:01,218 INFO L225 Difference]: With dead ends: 1712 [2022-11-03 03:49:01,218 INFO L226 Difference]: Without dead ends: 1712 [2022-11-03 03:49:01,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:49:01,223 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:01,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 26 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:49:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-03 03:49:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1328. [2022-11-03 03:49:01,269 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-03 03:49:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:49:01,275 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:49:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:01,276 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:49:01,276 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-03 03:49:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:49:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:49:01,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:01,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:01,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:49:01,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash 720212953, now seen corresponding path program 3 times [2022-11-03 03:49:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:01,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908720499] [2022-11-03 03:49:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:01,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:01,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908720499] [2022-11-03 03:49:01,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908720499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:01,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:01,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044026863] [2022-11-03 03:49:01,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:01,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:49:01,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:01,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:49:01,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:49:01,846 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-03 03:49:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:02,144 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-03 03:49:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:02,145 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-03 03:49:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:02,153 INFO L225 Difference]: With dead ends: 1537 [2022-11-03 03:49:02,154 INFO L226 Difference]: Without dead ends: 1537 [2022-11-03 03:49:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:49:02,155 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:02,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 21 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:49:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-03 03:49:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-03 03:49:02,196 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-03 03:49:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-03 03:49:02,202 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-03 03:49:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:02,203 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-03 03:49:02,203 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-03 03:49:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-03 03:49:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:49:02,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:02,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:02,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:49:02,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 527899556, now seen corresponding path program 1 times [2022-11-03 03:49:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:02,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970013369] [2022-11-03 03:49:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:02,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:02,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:02,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970013369] [2022-11-03 03:49:02,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970013369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:02,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:02,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373145981] [2022-11-03 03:49:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:02,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:49:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:49:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:49:02,282 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-03 03:49:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:02,525 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-03 03:49:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:49:02,526 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-03 03:49:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:02,538 INFO L225 Difference]: With dead ends: 2154 [2022-11-03 03:49:02,539 INFO L226 Difference]: Without dead ends: 2154 [2022-11-03 03:49:02,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:02,541 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:02,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 20 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:49:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-03 03:49:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-03 03:49:02,602 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-03 03:49:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-03 03:49:02,611 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-03 03:49:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-03 03:49:02,612 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-03 03:49:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-03 03:49:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:49:02,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:02,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:02,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:49:02,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 633487863, now seen corresponding path program 1 times [2022-11-03 03:49:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770682836] [2022-11-03 03:49:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:03,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:03,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770682836] [2022-11-03 03:49:03,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770682836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:03,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:03,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:49:03,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728735414] [2022-11-03 03:49:03,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:03,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:49:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:49:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:49:03,311 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-03 03:49:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:03,658 INFO L93 Difference]: Finished difference Result 1958 states and 5491 transitions. [2022-11-03 03:49:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:03,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-03 03:49:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:03,671 INFO L225 Difference]: With dead ends: 1958 [2022-11-03 03:49:03,671 INFO L226 Difference]: Without dead ends: 1958 [2022-11-03 03:49:03,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03 03:49:03,673 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:03,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:49:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-11-03 03:49:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1953. [2022-11-03 03:49:03,762 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-03 03:49:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-03 03:49:03,775 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-03 03:49:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:03,776 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-03 03:49:03,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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-03 03:49:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-03 03:49:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:49:03,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:03,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:03,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:49:03,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:03,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 505333492, now seen corresponding path program 1 times [2022-11-03 03:49:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133432617] [2022-11-03 03:49:03,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:03,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:03,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133432617] [2022-11-03 03:49:03,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133432617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:03,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:03,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:49:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017270828] [2022-11-03 03:49:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:03,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:03,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:03,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:03,895 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 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-03 03:49:03,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:03,993 INFO L93 Difference]: Finished difference Result 559 states and 1298 transitions. [2022-11-03 03:49:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:03,994 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-03 03:49:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:03,997 INFO L225 Difference]: With dead ends: 559 [2022-11-03 03:49:03,997 INFO L226 Difference]: Without dead ends: 537 [2022-11-03 03:49:03,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:03,999 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:03,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:49:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-03 03:49:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-03 03:49:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 519 states have (on average 2.420038535645472) internal successors, (1256), 536 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1256 transitions. [2022-11-03 03:49:04,021 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1256 transitions. Word has length 11 [2022-11-03 03:49:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:04,022 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1256 transitions. [2022-11-03 03:49:04,022 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-03 03:49:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1256 transitions. [2022-11-03 03:49:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:49:04,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:04,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:04,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:49:04,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash 657803752, now seen corresponding path program 1 times [2022-11-03 03:49:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:04,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006369963] [2022-11-03 03:49:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:04,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006369963] [2022-11-03 03:49:04,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006369963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:04,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:04,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533639215] [2022-11-03 03:49:04,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:04,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:49:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:49:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:49:04,918 INFO L87 Difference]: Start difference. First operand 537 states and 1256 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:05,366 INFO L93 Difference]: Finished difference Result 776 states and 1802 transitions. [2022-11-03 03:49:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:05,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-03 03:49:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:05,370 INFO L225 Difference]: With dead ends: 776 [2022-11-03 03:49:05,370 INFO L226 Difference]: Without dead ends: 776 [2022-11-03 03:49:05,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:49:05,371 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:05,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 18 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:49:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-11-03 03:49:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 592. [2022-11-03 03:49:05,388 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-03 03:49:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-03 03:49:05,391 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-03 03:49:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:05,391 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-03 03:49:05,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-03 03:49:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:49:05,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:05,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:05,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:49:05,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1736858162, now seen corresponding path program 2 times [2022-11-03 03:49:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:05,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490875691] [2022-11-03 03:49:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:06,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:06,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490875691] [2022-11-03 03:49:06,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490875691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:06,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:06,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628423797] [2022-11-03 03:49:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:06,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:49:06,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:49:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:49:06,225 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:06,723 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-03 03:49:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-03 03:49:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:06,729 INFO L225 Difference]: With dead ends: 820 [2022-11-03 03:49:06,729 INFO L226 Difference]: Without dead ends: 820 [2022-11-03 03:49:06,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03 03:49:06,731 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:49:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-03 03:49:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-03 03:49:06,751 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-03 03:49:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-03 03:49:06,754 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-03 03:49:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:06,754 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-03 03:49:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-03 03:49:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:49:06,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:06,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:49:06,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1835467546, now seen corresponding path program 3 times [2022-11-03 03:49:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381540661] [2022-11-03 03:49:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:07,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:07,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381540661] [2022-11-03 03:49:07,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381540661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:07,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:07,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:49:07,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19725985] [2022-11-03 03:49:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:07,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:49:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:07,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:49:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:49:07,622 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:08,037 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2022-11-03 03:49:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:49:08,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-03 03:49:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:08,042 INFO L225 Difference]: With dead ends: 798 [2022-11-03 03:49:08,042 INFO L226 Difference]: Without dead ends: 798 [2022-11-03 03:49:08,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-03 03:49:08,043 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:08,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 18 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:49:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-03 03:49:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 570. [2022-11-03 03:49:08,060 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-03 03:49:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-03 03:49:08,062 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-03 03:49:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:08,063 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-03 03:49:08,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-03 03:49:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:49:08,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:08,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:08,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:49:08,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 151555746, now seen corresponding path program 1 times [2022-11-03 03:49:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:08,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837271574] [2022-11-03 03:49:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:08,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837271574] [2022-11-03 03:49:08,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837271574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:49:08,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:49:08,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:49:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884786814] [2022-11-03 03:49:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:49:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:49:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:49:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:08,112 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:49:08,218 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-03 03:49:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:49:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 03:49:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:49:08,222 INFO L225 Difference]: With dead ends: 606 [2022-11-03 03:49:08,222 INFO L226 Difference]: Without dead ends: 606 [2022-11-03 03:49:08,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:49:08,223 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:49:08,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:49:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-03 03:49:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-03 03:49:08,239 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-03 03:49:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-03 03:49:08,241 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-03 03:49:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:49:08,243 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-03 03:49:08,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:49:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-03 03:49:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:49:08,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:49:08,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:49:08,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:49:08,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:49:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:49:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash 988549789, now seen corresponding path program 1 times [2022-11-03 03:49:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:49:08,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399992135] [2022-11-03 03:49:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:08,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:49:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:09,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:49:09,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399992135] [2022-11-03 03:49:09,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399992135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:49:09,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519038229] [2022-11-03 03:49:09,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:49:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:49:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:49:09,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:49:09,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:49:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:49:09,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:49:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:49:09,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:09,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:09,764 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:49:09,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:09,779 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:49:09,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:49:09,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:11,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:19,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:49:28,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:49:28,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:49:41,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:49:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:49:55,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:50:03,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:50:03,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_438 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 03:50:03,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_438) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-03 03:50:03,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_435) .cse1 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_438) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_435 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-03 03:50:03,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_435) .cse1 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_438) (< (+ (select .cse0 .cse2) 1) v_ArrVal_435) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:50:03,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_433)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_435) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_438))))) is different from false [2022-11-03 03:50:03,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| 4)) v_ArrVal_433)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_435) .cse1 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_438) (< (+ (select .cse3 .cse2) 1) v_ArrVal_435) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_226| (select .cse4 .cse1)))))))) is different from false [2022-11-03 03:50:03,699 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-03 03:50:03,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519038229] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:50:03,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1786574450] [2022-11-03 03:50:03,728 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:50:03,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:50:03,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 03:50:03,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289492826] [2022-11-03 03:50:03,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:50:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:50:03,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:03,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:50:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=478, Unknown=37, NotChecked=364, Total=992 [2022-11-03 03:50:03,732 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:50:16,165 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 100 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:50:54,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (exists ((v_ArrVal_433 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| Int) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse0 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 4) |c_~#queue~0.offset|) v_ArrVal_433))) (and (<= v_ArrVal_438 (+ (select .cse0 .cse1) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_223| 0) (= (store (store .cse0 .cse2 v_ArrVal_435) .cse1 v_ArrVal_438) .cse3) (<= v_ArrVal_435 (+ (select .cse0 .cse2) 1))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse3 1608) 1) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_225| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse2) 2147483647)))) (let ((.cse5 (select .cse3 1604))) (or (<= 403 .cse5) (<= .cse5 401))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:51:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:27,579 INFO L93 Difference]: Finished difference Result 609 states and 1414 transitions. [2022-11-03 03:51:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:51:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:51:27,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:27,583 INFO L225 Difference]: With dead ends: 609 [2022-11-03 03:51:27,583 INFO L226 Difference]: Without dead ends: 609 [2022-11-03 03:51:27,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 136.7s TimeCoverageRelationStatistics Valid=215, Invalid=873, Unknown=66, NotChecked=568, Total=1722 [2022-11-03 03:51:27,584 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:27,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 72 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 526 Unchecked, 0.3s Time] [2022-11-03 03:51:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2022-11-03 03:51:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2022-11-03 03:51:27,600 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-03 03:51:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1414 transitions. [2022-11-03 03:51:27,603 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1414 transitions. Word has length 16 [2022-11-03 03:51:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:27,603 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 1414 transitions. [2022-11-03 03:51:27,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1414 transitions. [2022-11-03 03:51:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:51:27,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:27,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:27,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:51:27,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:51:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash 988549840, now seen corresponding path program 1 times [2022-11-03 03:51:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312090846] [2022-11-03 03:51:27,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:27,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:28,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312090846] [2022-11-03 03:51:28,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312090846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:28,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106718542] [2022-11-03 03:51:28,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:28,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:28,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:28,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:51:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:28,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 03:51:28,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:28,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:51:28,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-03 03:51:28,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:28,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 03:51:28,728 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 03:51:28,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-03 03:51:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:29,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:35,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_522 Int) (v_ArrVal_520 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_520) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_522) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_522 2147483648) 0))) is different from false [2022-11-03 03:51:35,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_522 Int) (v_ArrVal_518 Int) (v_ArrVal_520 (Array Int Int))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_518)) |c_~#stored_elements~0.base| v_ArrVal_520) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_522) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_522 2147483648) 0))) is different from false [2022-11-03 03:51:35,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:35,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 03:51:35,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:35,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-03 03:51:35,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-03 03:51:35,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-03 03:51:35,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:51:35,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-11-03 03:51:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:35,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106718542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276988495] [2022-11-03 03:51:35,607 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:51:35,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:35,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 03:51:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280237243] [2022-11-03 03:51:35,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:35,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:51:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:51:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=332, Unknown=11, NotChecked=78, Total=506 [2022-11-03 03:51:35,612 INFO L87 Difference]: Start difference. First operand 609 states and 1414 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:36,478 INFO L93 Difference]: Finished difference Result 1318 states and 3056 transitions. [2022-11-03 03:51:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:51:36,479 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 03:51:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:36,485 INFO L225 Difference]: With dead ends: 1318 [2022-11-03 03:51:36,485 INFO L226 Difference]: Without dead ends: 1318 [2022-11-03 03:51:36,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=156, Invalid=491, Unknown=11, NotChecked=98, Total=756 [2022-11-03 03:51:36,486 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 422 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:36,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 59 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 509 Invalid, 0 Unknown, 309 Unchecked, 0.6s Time] [2022-11-03 03:51:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-03 03:51:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 773. [2022-11-03 03:51:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 755 states have (on average 2.4596026490066225) internal successors, (1857), 772 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1857 transitions. [2022-11-03 03:51:36,514 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1857 transitions. Word has length 16 [2022-11-03 03:51:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:36,514 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1857 transitions. [2022-11-03 03:51:36,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1857 transitions. [2022-11-03 03:51:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:51:36,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:36,516 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:36,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:36,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:51:36,726 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:51:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:36,727 INFO L85 PathProgramCache]: Analyzing trace with hash 846963150, now seen corresponding path program 1 times [2022-11-03 03:51:36,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:36,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325123916] [2022-11-03 03:51:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:51:37,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325123916] [2022-11-03 03:51:37,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325123916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:37,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866507420] [2022-11-03 03:51:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:37,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:37,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:51:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:38,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 03:51:38,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:38,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:38,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:38,073 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:51:38,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:38,095 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:51:38,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:51:38,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:51:40,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:51:43,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 66 [2022-11-03 03:51:54,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-03 03:52:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:52:07,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-03 03:52:19,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 52 [2022-11-03 03:52:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:52:33,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:52:42,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_623 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-03 03:52:42,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_623 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_620 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-03 03:52:42,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_623 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_620))))) is different from false [2022-11-03 03:52:42,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_618 Int) (v_ArrVal_623 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_618) .cse2 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_620) (not (<= v_ArrVal_618 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-03 03:52:42,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_618 Int) (v_ArrVal_623 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_618) .cse3 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_618) (< (+ (select .cse1 .cse3) 1) v_ArrVal_620))))) is different from false [2022-11-03 03:52:42,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_623 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_618) .cse2 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_618) (< (+ (select .cse0 .cse2) 1) v_ArrVal_620) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:52:42,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_623 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_616))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_618) .cse1 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_618) (< (+ 1 (select .cse3 .cse1)) v_ArrVal_620)))))) is different from false [2022-11-03 03:52:42,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_623 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_615))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) v_ArrVal_616))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_618) .cse1 v_ArrVal_620)) |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_620) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) .cse3) 2147483647) (< (+ 1 (select .cse0 .cse3)) v_ArrVal_618)))))) is different from false [2022-11-03 03:52:42,941 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-03 03:52:42,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866507420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:52:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1816005511] [2022-11-03 03:52:42,942 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:52:42,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:52:42,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:52:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098053173] [2022-11-03 03:52:42,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:52:42,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:52:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:52:42,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:52:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=555, Unknown=50, NotChecked=456, Total=1190 [2022-11-03 03:52:42,945 INFO L87 Difference]: Start difference. First operand 773 states and 1857 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-03 03:54:03,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (exists ((v_ArrVal_620 Int) (v_ArrVal_608 Int) (v_ArrVal_618 Int) (v_ArrVal_616 Int)) (and (<= v_ArrVal_608 0) (<= v_ArrVal_620 1) (= .cse0 (store (store (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 v_ArrVal_608) |c_~#queue~0.offset| v_ArrVal_616) .cse2 v_ArrVal_618) .cse1 v_ArrVal_620)) (<= v_ArrVal_618 (+ v_ArrVal_608 1)))) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_622 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| Int) (v_ArrVal_623 Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_622) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| 4)) v_ArrVal_623) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_234| (select .cse3 .cse1)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:54:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:46,443 INFO L93 Difference]: Finished difference Result 796 states and 1897 transitions. [2022-11-03 03:54:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:54:46,444 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-03 03:54:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:46,448 INFO L225 Difference]: With dead ends: 796 [2022-11-03 03:54:46,448 INFO L226 Difference]: Without dead ends: 796 [2022-11-03 03:54:46,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 187.5s TimeCoverageRelationStatistics Valid=227, Invalid=1039, Unknown=102, NotChecked=702, Total=2070 [2022-11-03 03:54:46,450 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:46,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 485 Unchecked, 0.2s Time] [2022-11-03 03:54:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-11-03 03:54:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 786. [2022-11-03 03:54:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 768 states have (on average 2.453125) internal successors, (1884), 785 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:54:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1884 transitions. [2022-11-03 03:54:46,491 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1884 transitions. Word has length 17 [2022-11-03 03:54:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:46,492 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 1884 transitions. [2022-11-03 03:54:46,493 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-03 03:54:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1884 transitions. [2022-11-03 03:54:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:54:46,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:46,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:46,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:54:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:54:46,714 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:54:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:46,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1972386568, now seen corresponding path program 2 times [2022-11-03 03:54:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263051000] [2022-11-03 03:54:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:54:47,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:47,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263051000] [2022-11-03 03:54:47,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263051000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:54:47,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236894532] [2022-11-03 03:54:47,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:54:47,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:54:47,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:54:47,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:54:47,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:54:48,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:54:48,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:54:48,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-03 03:54:48,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:54:48,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:54:48,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:54:48,074 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:54:48,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 03:54:48,105 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:54:48,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:54:48,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:54:48,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:54:49,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 73 treesize of output 66 [2022-11-03 03:54:52,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-11-03 03:54:58,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:54:58,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-03 03:55:04,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 42 [2022-11-03 03:55:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:55:13,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:55:22,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:55:22,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_723 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-03 03:55:22,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_723) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 03:55:22,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse1 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_723) (not (<= v_ArrVal_721 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-03 03:55:22,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_721) .cse1 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_723) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_721))))) is different from false [2022-11-03 03:55:22,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_719 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_719)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_721) .cse2 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_723) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_721))))) is different from false [2022-11-03 03:55:22,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_719 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_719))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_721) .cse1 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) .cse2) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_723) (< (+ (select .cse3 .cse2) 1) v_ArrVal_721)))))) is different from false [2022-11-03 03:55:22,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_719 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_727 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_718))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_719))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_721) .cse2 v_ArrVal_723)) |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_721) (< (+ (select .cse3 .cse2) 1) v_ArrVal_723)))))) is different from false [2022-11-03 03:55:22,825 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-03 03:55:22,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236894532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:55:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1150056883] [2022-11-03 03:55:22,826 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:55:22,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:55:22,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:55:22,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912636535] [2022-11-03 03:55:22,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:55:22,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:55:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:55:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:55:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=520, Unknown=38, NotChecked=456, Total=1190 [2022-11-03 03:55:22,830 INFO L87 Difference]: Start difference. First operand 786 states and 1884 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-03 03:56:12,238 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_725 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_727 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_725) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_727) .cse2) 2147483647)))) (= |c_~#queue~0.offset| 0) (exists ((v_ArrVal_719 Int) (v_ArrVal_723 Int) (v_ArrVal_721 Int)) (and (<= v_ArrVal_721 1) (<= v_ArrVal_723 1) (= (select |c_#memory_int| |c_~#queue~0.base|) (store (store (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_~#queue~0.offset|) 0) .cse1 0) .cse2 0) |c_~#queue~0.offset| v_ArrVal_719) .cse2 v_ArrVal_721) .cse1 v_ArrVal_723)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 03:56:12,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:56:12,406 INFO L93 Difference]: Finished difference Result 983 states and 2337 transitions. [2022-11-03 03:56:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:56:12,406 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-03 03:56:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:56:12,411 INFO L225 Difference]: With dead ends: 983 [2022-11-03 03:56:12,411 INFO L226 Difference]: Without dead ends: 983 [2022-11-03 03:56:12,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=282, Invalid=810, Unknown=66, NotChecked=648, Total=1806 [2022-11-03 03:56:12,412 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 149 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1826 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:56:12,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 138 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 314 Invalid, 0 Unknown, 1826 Unchecked, 0.3s Time] [2022-11-03 03:56:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-11-03 03:56:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 946. [2022-11-03 03:56:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 928 states have (on average 2.449353448275862) internal successors, (2273), 945 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:56:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2273 transitions. [2022-11-03 03:56:12,442 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2273 transitions. Word has length 17 [2022-11-03 03:56:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:56:12,443 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 2273 transitions. [2022-11-03 03:56:12,443 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-03 03:56:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2273 transitions. [2022-11-03 03:56:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:56:12,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:56:12,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:56:12,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:56:12,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:56:12,658 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 03:56:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:56:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash -650076596, now seen corresponding path program 3 times [2022-11-03 03:56:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:56:12,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548953219] [2022-11-03 03:56:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:56:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:56:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:56:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:56:13,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:56:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548953219] [2022-11-03 03:56:13,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548953219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:56:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58846763] [2022-11-03 03:56:13,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:56:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:56:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:56:13,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:56:13,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:56:13,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:56:13,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:56:13,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 03:56:13,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:56:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:14,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:14,021 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:56:14,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:56:14,045 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 03:56:14,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 03:56:14,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:56:16,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:56:16,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:56:27,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 03:56:41,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:56:41,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 03:56:58,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 03:57:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:14,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:22,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-03 03:57:22,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_827 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-03 03:57:22,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_827))))) is different from false [2022-11-03 03:57:22,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse2 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_825 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_827))))) is different from false [2022-11-03 03:57:22,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse2 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_827) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_825 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-03 03:57:22,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_825) .cse2 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_827) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) 1) v_ArrVal_825)))))) is different from false [2022-11-03 03:57:23,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_821 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_821))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse2 v_ArrVal_825) .cse4 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_825) (< (+ (select .cse3 .cse4) 1) v_ArrVal_827) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-11-03 03:57:23,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_830 Int) (v_ArrVal_823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| Int) (v_ArrVal_827 Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_821 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| 4) |c_~#queue~0.offset|) v_ArrVal_821))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_823))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_825) .cse1 v_ArrVal_827)) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_827) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_245| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_825)))))))) is different from false [2022-11-03 03:57:23,163 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-03 03:57:23,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58846763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:23,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1749149524] [2022-11-03 03:57:23,164 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 03:57:23,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 03:57:23,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838091355] [2022-11-03 03:57:23,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:23,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:57:23,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:57:23,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=560, Unknown=45, NotChecked=456, Total=1190 [2022-11-03 03:57:23,167 INFO L87 Difference]: Start difference. First operand 946 states and 2273 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-03 03:57:38,932 WARN L234 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 111 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:59:25,368 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (= |c_~#queue~0.offset| 0) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| Int) (v_ArrVal_827 Int) (v_ArrVal_825 Int) (v_ArrVal_821 Int)) (let ((.cse1 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_~#queue~0.offset|) 0) .cse2 0) .cse3 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_821))) (and (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_242| 0) (<= v_ArrVal_827 (+ (select .cse1 .cse2) 1)) (<= v_ArrVal_825 (+ (select .cse1 .cse3) 1)) (= .cse0 (store (store .cse1 .cse3 v_ArrVal_825) .cse2 v_ArrVal_827))))) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_830 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_830) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_244| (select .cse4 .cse2)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 04:00:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:19,895 INFO L93 Difference]: Finished difference Result 1338 states and 3160 transitions. [2022-11-03 04:00:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 04:00:19,895 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-03 04:00:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:19,902 INFO L225 Difference]: With dead ends: 1338 [2022-11-03 04:00:19,902 INFO L226 Difference]: Without dead ends: 1338 [2022-11-03 04:00:19,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 244.8s TimeCoverageRelationStatistics Valid=324, Invalid=1336, Unknown=98, NotChecked=792, Total=2550 [2022-11-03 04:00:19,904 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 215 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1592 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:19,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 180 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 505 Invalid, 0 Unknown, 1592 Unchecked, 0.5s Time] [2022-11-03 04:00:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-11-03 04:00:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1005. [2022-11-03 04:00:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 987 states have (on average 2.4488348530901725) internal successors, (2417), 1004 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 2417 transitions. [2022-11-03 04:00:19,940 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 2417 transitions. Word has length 17 [2022-11-03 04:00:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:19,940 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 2417 transitions. [2022-11-03 04:00:19,941 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-03 04:00:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 2417 transitions. [2022-11-03 04:00:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:00:19,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:19,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:19,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:20,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 04:00:20,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-03 04:00:20,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash 859798748, now seen corresponding path program 4 times [2022-11-03 04:00:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194874458] [2022-11-03 04:00:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:22,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194874458] [2022-11-03 04:00:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194874458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:22,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404709813] [2022-11-03 04:00:22,363 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:00:22,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:22,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:22,367 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:22,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a35c2a1d-e141-480b-aecc-d005e4f653b5/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:00:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:22,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 04:00:22,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:22,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:22,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:22,605 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:00:22,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:22,632 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 04:00:22,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:00:22,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:24,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:29,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 04:00:35,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 04:00:49,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:49,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 04:01:07,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:23,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:34,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-03 04:01:34,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_930 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-03 04:01:34,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_930) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-03 04:01:34,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_928))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_930)))))) is different from false [2022-11-03 04:01:34,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_927)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_928))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_927 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_930) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-03 04:01:34,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_927)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_928))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_930) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_927))))))) is different from false [2022-11-03 04:01:34,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_925 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_925)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_927)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_928))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_927) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_930))))))) is different from false [2022-11-03 04:01:35,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_925 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_250| Int) (v_ArrVal_932 Int) (v_ArrVal_930 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_250| 4)) v_ArrVal_925)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_927)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_928))) (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_930)) |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_250| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_930) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_927)))))))) is different from false [2022-11-03 04:01:35,142 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-03 04:01:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404709813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2124575587] [2022-11-03 04:01:35,144 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:01:35,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:35,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 04:01:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396068591] [2022-11-03 04:01:35,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:01:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:01:35,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=552, Unknown=44, NotChecked=456, Total=1190 [2022-11-03 04:01:35,148 INFO L87 Difference]: Start difference. First operand 1005 states and 2417 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-03 04:01:41,175 WARN L234 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 86 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:02:09,297 WARN L234 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 106 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:03:21,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (<= (* (select .cse0 1604) 4) 4) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse0 1608) 1) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_931 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| Int) (v_ArrVal_932 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| 4) |c_~#queue~0.offset|) v_ArrVal_932) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_249| (select .cse1 .cse3)))))) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247| Int) (v_ArrVal_927 Int) (v_ArrVal_925 Int) (v_ArrVal_930 Int)) (let ((.cse4 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_~#queue~0.offset|) 0) .cse3 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247| 4) |c_~#queue~0.offset|) v_ArrVal_925))) (and (<= v_ArrVal_930 (+ (select .cse4 .cse3) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_247| 0) (= (store (store .cse4 .cse2 v_ArrVal_927) .cse3 v_ArrVal_930) .cse0) (<= v_ArrVal_927 (+ (select .cse4 .cse2) 1))))) (<= |c_~#stored_elements~0.base| 6))) is different from false