./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh --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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:32:31,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:32:31,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:32:31,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:32:31,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:32:31,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:32:31,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:32:31,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:32:31,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:32:31,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:32:31,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:32:31,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:32:31,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:32:31,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:32:31,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:32:31,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:32:31,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:32:31,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:32:31,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:32:31,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:32:31,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:32:31,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:32:31,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:32:31,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:32:31,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:32:31,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:32:31,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:32:31,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:32:31,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:32:31,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:32:31,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:32:31,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:32:31,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:32:31,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:32:31,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:32:31,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:32:31,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:32:31,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:32:31,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:32:31,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:32:31,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:32:31,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 06:32:31,515 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:32:31,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:32:31,516 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:32:31,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:32:31,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:32:31,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:32:31,516 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:32:31,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:32:31,517 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:32:31,518 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:32:31,518 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:32:31,518 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:32:31,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:32:31,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:32:31,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:32:31,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:32:31,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:32:31,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:32:31,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:32:31,521 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:32:31,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:32:31,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:32:31,522 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:32:31,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:32:31,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:32:31,522 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:32:31,522 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_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2022-12-14 06:32:31,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:32:31,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:32:31,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:32:31,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:32:31,700 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:32:31,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_longer.i [2022-12-14 06:32:34,155 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:32:34,351 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:32:34,352 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i [2022-12-14 06:32:34,365 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/data/485289793/e064d109fb4c46b1ac26b5e3959ea994/FLAGc18a8ae1e [2022-12-14 06:32:34,729 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/data/485289793/e064d109fb4c46b1ac26b5e3959ea994 [2022-12-14 06:32:34,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:32:34,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:32:34,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:32:34,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:32:34,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:32:34,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:32:34" (1/1) ... [2022-12-14 06:32:34,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103b3e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:34, skipping insertion in model container [2022-12-14 06:32:34,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:32:34" (1/1) ... [2022-12-14 06:32:34,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:32:34,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:32:35,084 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-12-14 06:32:35,087 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-12-14 06:32:35,088 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-12-14 06:32:35,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:32:35,100 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:32:35,131 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2022-12-14 06:32:35,132 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2022-12-14 06:32:35,135 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2022-12-14 06:32:35,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:32:35,169 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:32:35,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35 WrapperNode [2022-12-14 06:32:35,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:32:35,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:32:35,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:32:35,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:32:35,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,207 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2022-12-14 06:32:35,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:32:35,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:32:35,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:32:35,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:32:35,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:32:35,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:32:35,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:32:35,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:32:35,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (1/1) ... [2022-12-14 06:32:35,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:32:35,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:32:35,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:32:35,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:32:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 06:32:35,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 06:32:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 06:32:35,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 06:32:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 06:32:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 06:32:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 06:32:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 06:32:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 06:32:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:32:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:32:35,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:32:35,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:32:35,296 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 06:32:35,405 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:32:35,407 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:32:35,722 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:32:35,731 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:32:35,732 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 06:32:35,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:32:35 BoogieIcfgContainer [2022-12-14 06:32:35,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:32:35,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:32:35,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:32:35,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:32:35,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:32:34" (1/3) ... [2022-12-14 06:32:35,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf7653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:32:35, skipping insertion in model container [2022-12-14 06:32:35,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:32:35" (2/3) ... [2022-12-14 06:32:35,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf7653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:32:35, skipping insertion in model container [2022-12-14 06:32:35,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:32:35" (3/3) ... [2022-12-14 06:32:35,743 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-14 06:32:35,752 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 06:32:35,762 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:32:35,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 06:32:35,762 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 06:32:35,848 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 06:32:35,874 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 06:32:35,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 297 places, 305 transitions, 626 flow [2022-12-14 06:32:35,887 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 297 places, 305 transitions, 626 flow [2022-12-14 06:32:35,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 305 transitions, 626 flow [2022-12-14 06:32:35,967 INFO L130 PetriNetUnfolder]: 15/303 cut-off events. [2022-12-14 06:32:35,967 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 06:32:35,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 303 events. 15/303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 471 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-12-14 06:32:35,981 INFO L119 LiptonReduction]: Number of co-enabled transitions 23276 [2022-12-14 06:32:43,597 INFO L134 LiptonReduction]: Checked pairs total: 50834 [2022-12-14 06:32:43,598 INFO L136 LiptonReduction]: Total number of compositions: 293 [2022-12-14 06:32:43,603 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 80 transitions, 176 flow [2022-12-14 06:32:43,662 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:43,676 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:32:43,681 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;@33403445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:32:43,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-12-14 06:32:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 06:32:43,689 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:43,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 06:32:43,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1281212597, now seen corresponding path program 1 times [2022-12-14 06:32:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:43,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138051663] [2022-12-14 06:32:43,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:44,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:44,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138051663] [2022-12-14 06:32:44,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138051663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:44,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:32:44,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788449227] [2022-12-14 06:32:44,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:44,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 06:32:44,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 06:32:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 06:32:44,651 INFO L87 Difference]: Start difference. First operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:45,667 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-12-14 06:32:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:32:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 06:32:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:45,687 INFO L225 Difference]: With dead ends: 1880 [2022-12-14 06:32:45,687 INFO L226 Difference]: Without dead ends: 1880 [2022-12-14 06:32:45,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:32:45,690 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:45,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 06:32:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-12-14 06:32:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-12-14 06:32:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1790 states have (on average 2.7592178770949722) internal successors, (4939), 1879 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-12-14 06:32:45,772 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-12-14 06:32:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:45,772 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-12-14 06:32:45,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-12-14 06:32:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 06:32:45,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:45,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:45,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:32:45,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:45,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:45,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1062887374, now seen corresponding path program 1 times [2022-12-14 06:32:45,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:45,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854247192] [2022-12-14 06:32:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:45,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:46,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854247192] [2022-12-14 06:32:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854247192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:46,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:32:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995904803] [2022-12-14 06:32:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:32:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:46,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:32:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:32:46,118 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-12-14 06:32:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:46,486 INFO L93 Difference]: Finished difference Result 1994 states and 5235 transitions. [2022-12-14 06:32:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:32:46,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-12-14 06:32:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:46,495 INFO L225 Difference]: With dead ends: 1994 [2022-12-14 06:32:46,496 INFO L226 Difference]: Without dead ends: 1994 [2022-12-14 06:32:46,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:32:46,497 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:46,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 31 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:32:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-12-14 06:32:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1970. [2022-12-14 06:32:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1880 states have (on average 2.751595744680851) internal successors, (5173), 1969 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-12-14 06:32:46,538 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-12-14 06:32:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:46,538 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-12-14 06:32:46,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-12-14 06:32:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-12-14 06:32:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 06:32:46,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:46,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:46,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:32:46,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1742120641, now seen corresponding path program 1 times [2022-12-14 06:32:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:46,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71020544] [2022-12-14 06:32:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:46,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:46,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71020544] [2022-12-14 06:32:46,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71020544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:46,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:46,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927012854] [2022-12-14 06:32:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:46,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:46,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:46,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:46,575 INFO L87 Difference]: Start difference. First operand 1970 states and 5173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:46,717 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-12-14 06:32:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:46,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 06:32:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:46,729 INFO L225 Difference]: With dead ends: 3434 [2022-12-14 06:32:46,730 INFO L226 Difference]: Without dead ends: 3434 [2022-12-14 06:32:46,730 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-12-14 06:32:46,731 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:46,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 16 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-12-14 06:32:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-12-14 06:32:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3024 states have (on average 2.8382936507936507) internal successors, (8583), 3113 states have internal predecessors, (8583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-12-14 06:32:46,802 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-12-14 06:32:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:46,802 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-12-14 06:32:46,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-12-14 06:32:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:32:46,803 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:46,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:46,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:32:46,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -774272492, now seen corresponding path program 1 times [2022-12-14 06:32:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:46,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868416081] [2022-12-14 06:32:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:47,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:47,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868416081] [2022-12-14 06:32:47,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868416081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:47,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:47,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:32:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599819687] [2022-12-14 06:32:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:47,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 06:32:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 06:32:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 06:32:47,294 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12-14 06:32:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:47,578 INFO L93 Difference]: Finished difference Result 3745 states and 10155 transitions. [2022-12-14 06:32:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:32:47,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12-14 06:32:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:47,591 INFO L225 Difference]: With dead ends: 3745 [2022-12-14 06:32:47,591 INFO L226 Difference]: Without dead ends: 3745 [2022-12-14 06:32:47,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:32:47,592 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:47,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:32:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2022-12-14 06:32:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3111. [2022-12-14 06:32:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 3021 states have (on average 2.8387951009599472) internal successors, (8576), 3110 states have internal predecessors, (8576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-12-14 06:32:47,664 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-12-14 06:32:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:47,665 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-12-14 06:32:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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-12-14 06:32:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-12-14 06:32:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 06:32:47,665 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:47,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:47,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:32:47,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1824752360, now seen corresponding path program 1 times [2022-12-14 06:32:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:47,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450885165] [2022-12-14 06:32:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:47,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:47,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450885165] [2022-12-14 06:32:47,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450885165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:47,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:47,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371658468] [2022-12-14 06:32:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:47,702 INFO L87 Difference]: Start difference. First operand 3111 states and 8576 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-12-14 06:32:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:47,825 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-12-14 06:32:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-12-14 06:32:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:47,839 INFO L225 Difference]: With dead ends: 2873 [2022-12-14 06:32:47,840 INFO L226 Difference]: Without dead ends: 2865 [2022-12-14 06:32:47,840 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-12-14 06:32:47,840 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:47,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-12-14 06:32:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-12-14 06:32:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2627 states have (on average 2.832508564902931) internal successors, (7441), 2704 states have internal predecessors, (7441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-12-14 06:32:47,924 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-12-14 06:32:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:47,925 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-12-14 06:32:47,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-12-14 06:32:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-12-14 06:32:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 06:32:47,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:47,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:47,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:32:47,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:47,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1767358995, now seen corresponding path program 1 times [2022-12-14 06:32:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:47,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023513433] [2022-12-14 06:32:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:48,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:48,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023513433] [2022-12-14 06:32:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023513433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 06:32:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454509030] [2022-12-14 06:32:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:48,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:32:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:32:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:32:48,580 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-12-14 06:32:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:49,313 INFO L93 Difference]: Finished difference Result 3106 states and 8434 transitions. [2022-12-14 06:32:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 06:32:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-12-14 06:32:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:49,330 INFO L225 Difference]: With dead ends: 3106 [2022-12-14 06:32:49,330 INFO L226 Difference]: Without dead ends: 3106 [2022-12-14 06:32:49,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:32:49,332 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 80 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:49,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 45 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:32:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2022-12-14 06:32:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2634. [2022-12-14 06:32:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2564 states have (on average 2.8205928237129485) internal successors, (7232), 2633 states have internal predecessors, (7232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-12-14 06:32:49,432 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-12-14 06:32:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:49,433 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-12-14 06:32:49,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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-12-14 06:32:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-12-14 06:32:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 06:32:49,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:49,435 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:49,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:32:49,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:49,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash 875153288, now seen corresponding path program 1 times [2022-12-14 06:32:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:49,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059964768] [2022-12-14 06:32:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:49,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059964768] [2022-12-14 06:32:49,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059964768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:49,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:49,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:49,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693437869] [2022-12-14 06:32:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:49,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:49,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:49,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:49,471 INFO L87 Difference]: Start difference. First operand 2634 states and 7232 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:49,574 INFO L93 Difference]: Finished difference Result 2562 states and 7001 transitions. [2022-12-14 06:32:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 06:32:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:49,584 INFO L225 Difference]: With dead ends: 2562 [2022-12-14 06:32:49,584 INFO L226 Difference]: Without dead ends: 2562 [2022-12-14 06:32:49,585 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-12-14 06:32:49,585 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:49,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-12-14 06:32:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-12-14 06:32:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2501 states have (on average 2.799280287884846) internal successors, (7001), 2561 states have internal predecessors, (7001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-12-14 06:32:49,643 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-12-14 06:32:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:49,643 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-12-14 06:32:49,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-12-14 06:32:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 06:32:49,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:49,644 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:49,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:32:49,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 875153424, now seen corresponding path program 1 times [2022-12-14 06:32:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932957490] [2022-12-14 06:32:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:32:49,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:49,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932957490] [2022-12-14 06:32:49,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932957490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:49,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:49,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321284657] [2022-12-14 06:32:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:49,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:49,679 INFO L87 Difference]: Start difference. First operand 2562 states and 7001 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:49,758 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-12-14 06:32:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 06:32:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:49,765 INFO L225 Difference]: With dead ends: 2490 [2022-12-14 06:32:49,765 INFO L226 Difference]: Without dead ends: 2420 [2022-12-14 06:32:49,765 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-12-14 06:32:49,766 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:49,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-12-14 06:32:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-12-14 06:32:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1524 states have (on average 2.776246719160105) internal successors, (4231), 1575 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-12-14 06:32:49,811 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-12-14 06:32:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:49,811 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-12-14 06:32:49,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-12-14 06:32:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:32:49,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:49,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:49,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:32:49,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash 676618660, now seen corresponding path program 1 times [2022-12-14 06:32:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415420644] [2022-12-14 06:32:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:49,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:49,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415420644] [2022-12-14 06:32:49,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415420644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:49,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:49,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796035132] [2022-12-14 06:32:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:49,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:49,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:49,856 INFO L87 Difference]: Start difference. First operand 1576 states and 4231 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:49,953 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-12-14 06:32:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 06:32:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:49,959 INFO L225 Difference]: With dead ends: 1948 [2022-12-14 06:32:49,959 INFO L226 Difference]: Without dead ends: 1948 [2022-12-14 06:32:49,959 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-12-14 06:32:49,960 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:49,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 13 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-12-14 06:32:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-12-14 06:32:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1832 states have (on average 2.7974890829694323) internal successors, (5125), 1883 states have internal predecessors, (5125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-12-14 06:32:49,995 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-12-14 06:32:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:49,995 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-12-14 06:32:49,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:49,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-12-14 06:32:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:32:49,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:49,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 06:32:49,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -502483707, now seen corresponding path program 1 times [2022-12-14 06:32:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:49,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668827039] [2022-12-14 06:32:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:50,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668827039] [2022-12-14 06:32:50,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668827039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:50,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:50,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 06:32:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845932079] [2022-12-14 06:32:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:50,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 06:32:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 06:32:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:32:50,840 INFO L87 Difference]: Start difference. First operand 1884 states and 5125 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:51,401 INFO L93 Difference]: Finished difference Result 1939 states and 5215 transitions. [2022-12-14 06:32:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 06:32:51,401 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 06:32:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:51,408 INFO L225 Difference]: With dead ends: 1939 [2022-12-14 06:32:51,408 INFO L226 Difference]: Without dead ends: 1939 [2022-12-14 06:32:51,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-12-14 06:32:51,409 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:51,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 64 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:32:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2022-12-14 06:32:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1883. [2022-12-14 06:32:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1831 states have (on average 2.797378481703987) internal successors, (5122), 1882 states have internal predecessors, (5122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5122 transitions. [2022-12-14 06:32:51,446 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 5122 transitions. Word has length 18 [2022-12-14 06:32:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:51,446 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 5122 transitions. [2022-12-14 06:32:51,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 5122 transitions. [2022-12-14 06:32:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:32:51,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:51,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:51,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 06:32:51,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:51,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash -502483670, now seen corresponding path program 1 times [2022-12-14 06:32:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:51,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057003291] [2022-12-14 06:32:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:52,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:52,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057003291] [2022-12-14 06:32:52,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057003291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:52,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:52,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 06:32:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035840997] [2022-12-14 06:32:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:52,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 06:32:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 06:32:52,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:32:52,176 INFO L87 Difference]: Start difference. First operand 1883 states and 5122 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:52,787 INFO L93 Difference]: Finished difference Result 1933 states and 5203 transitions. [2022-12-14 06:32:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 06:32:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 06:32:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:52,791 INFO L225 Difference]: With dead ends: 1933 [2022-12-14 06:32:52,792 INFO L226 Difference]: Without dead ends: 1933 [2022-12-14 06:32:52,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-12-14 06:32:52,792 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:52,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:32:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-12-14 06:32:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1882. [2022-12-14 06:32:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1830 states have (on average 2.7972677595628417) internal successors, (5119), 1881 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 5119 transitions. [2022-12-14 06:32:52,818 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 5119 transitions. Word has length 18 [2022-12-14 06:32:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:52,818 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 5119 transitions. [2022-12-14 06:32:52,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 5119 transitions. [2022-12-14 06:32:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:32:52,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:52,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:52,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 06:32:52,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1702659138, now seen corresponding path program 1 times [2022-12-14 06:32:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:52,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563978101] [2022-12-14 06:32:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:53,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563978101] [2022-12-14 06:32:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563978101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 06:32:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204517047] [2022-12-14 06:32:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:53,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 06:32:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 06:32:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-14 06:32:53,526 INFO L87 Difference]: Start difference. First operand 1882 states and 5119 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:54,084 INFO L93 Difference]: Finished difference Result 2083 states and 5624 transitions. [2022-12-14 06:32:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:32:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 06:32:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:54,088 INFO L225 Difference]: With dead ends: 2083 [2022-12-14 06:32:54,088 INFO L226 Difference]: Without dead ends: 2083 [2022-12-14 06:32:54,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-12-14 06:32:54,089 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 209 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:54,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 84 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:32:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2022-12-14 06:32:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1982. [2022-12-14 06:32:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1930 states have (on average 2.8145077720207254) internal successors, (5432), 1981 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5432 transitions. [2022-12-14 06:32:54,116 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5432 transitions. Word has length 19 [2022-12-14 06:32:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:54,116 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 5432 transitions. [2022-12-14 06:32:54,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5432 transitions. [2022-12-14 06:32:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:32:54,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:54,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:54,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 06:32:54,117 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1702659175, now seen corresponding path program 1 times [2022-12-14 06:32:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:54,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277618112] [2022-12-14 06:32:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:55,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:55,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277618112] [2022-12-14 06:32:55,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277618112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:55,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 06:32:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313857812] [2022-12-14 06:32:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:55,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 06:32:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 06:32:55,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:32:55,234 INFO L87 Difference]: Start difference. First operand 1982 states and 5432 transitions. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:55,905 INFO L93 Difference]: Finished difference Result 2107 states and 5735 transitions. [2022-12-14 06:32:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 06:32:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 06:32:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:55,910 INFO L225 Difference]: With dead ends: 2107 [2022-12-14 06:32:55,910 INFO L226 Difference]: Without dead ends: 2107 [2022-12-14 06:32:55,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-12-14 06:32:55,910 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 280 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:55,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 73 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:32:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2022-12-14 06:32:55,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2042. [2022-12-14 06:32:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1990 states have (on average 2.808040201005025) internal successors, (5588), 2041 states have internal predecessors, (5588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5588 transitions. [2022-12-14 06:32:55,940 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 5588 transitions. Word has length 19 [2022-12-14 06:32:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:55,940 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 5588 transitions. [2022-12-14 06:32:55,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 5588 transitions. [2022-12-14 06:32:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:32:55,941 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:55,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:55,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 06:32:55,941 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1602877578, now seen corresponding path program 2 times [2022-12-14 06:32:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:55,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237074501] [2022-12-14 06:32:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:56,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:56,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237074501] [2022-12-14 06:32:56,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237074501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:56,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:56,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 06:32:56,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187361138] [2022-12-14 06:32:56,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:56,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 06:32:56,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 06:32:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:32:56,555 INFO L87 Difference]: Start difference. First operand 2042 states and 5588 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:57,013 INFO L93 Difference]: Finished difference Result 2138 states and 5748 transitions. [2022-12-14 06:32:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:32:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 06:32:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:57,017 INFO L225 Difference]: With dead ends: 2138 [2022-12-14 06:32:57,017 INFO L226 Difference]: Without dead ends: 2138 [2022-12-14 06:32:57,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-12-14 06:32:57,018 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 208 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:57,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 76 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:32:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-12-14 06:32:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2017. [2022-12-14 06:32:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1965 states have (on average 2.7918575063613233) internal successors, (5486), 2016 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 5486 transitions. [2022-12-14 06:32:57,043 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 5486 transitions. Word has length 19 [2022-12-14 06:32:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:57,043 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 5486 transitions. [2022-12-14 06:32:57,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 5486 transitions. [2022-12-14 06:32:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:32:57,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:57,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 06:32:57,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1602877615, now seen corresponding path program 2 times [2022-12-14 06:32:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:57,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700358607] [2022-12-14 06:32:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:57,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700358607] [2022-12-14 06:32:57,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700358607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:57,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:57,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 06:32:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413051353] [2022-12-14 06:32:57,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:57,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 06:32:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 06:32:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:32:57,783 INFO L87 Difference]: Start difference. First operand 2017 states and 5486 transitions. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:58,504 INFO L93 Difference]: Finished difference Result 2093 states and 5586 transitions. [2022-12-14 06:32:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 06:32:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 06:32:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:58,508 INFO L225 Difference]: With dead ends: 2093 [2022-12-14 06:32:58,508 INFO L226 Difference]: Without dead ends: 2093 [2022-12-14 06:32:58,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-12-14 06:32:58,509 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:58,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 106 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:32:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-12-14 06:32:58,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1952. [2022-12-14 06:32:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1900 states have (on average 2.784736842105263) internal successors, (5291), 1951 states have internal predecessors, (5291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5291 transitions. [2022-12-14 06:32:58,540 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5291 transitions. Word has length 19 [2022-12-14 06:32:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:58,540 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5291 transitions. [2022-12-14 06:32:58,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5291 transitions. [2022-12-14 06:32:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 06:32:58,541 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:58,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:58,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 06:32:58,542 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash 870247718, now seen corresponding path program 1 times [2022-12-14 06:32:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:58,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164287602] [2022-12-14 06:32:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:58,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:58,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164287602] [2022-12-14 06:32:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164287602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:58,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490050347] [2022-12-14 06:32:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:58,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:58,585 INFO L87 Difference]: Start difference. First operand 1952 states and 5291 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:58,645 INFO L93 Difference]: Finished difference Result 1832 states and 4965 transitions. [2022-12-14 06:32:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 06:32:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:58,650 INFO L225 Difference]: With dead ends: 1832 [2022-12-14 06:32:58,650 INFO L226 Difference]: Without dead ends: 1832 [2022-12-14 06:32:58,650 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-12-14 06:32:58,651 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:58,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 8 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-12-14 06:32:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1832. [2022-12-14 06:32:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1792 states have (on average 2.7706473214285716) internal successors, (4965), 1831 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4965 transitions. [2022-12-14 06:32:58,683 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4965 transitions. Word has length 20 [2022-12-14 06:32:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:58,683 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 4965 transitions. [2022-12-14 06:32:58,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4965 transitions. [2022-12-14 06:32:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 06:32:58,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:58,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 06:32:58,685 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 870247822, now seen corresponding path program 1 times [2022-12-14 06:32:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:58,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808816236] [2022-12-14 06:32:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:32:58,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808816236] [2022-12-14 06:32:58,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808816236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:58,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:58,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:32:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754997312] [2022-12-14 06:32:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:58,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:32:58,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:58,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:32:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:32:58,717 INFO L87 Difference]: Start difference. First operand 1832 states and 4965 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:58,797 INFO L93 Difference]: Finished difference Result 1712 states and 4639 transitions. [2022-12-14 06:32:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:32:58,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 06:32:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:58,802 INFO L225 Difference]: With dead ends: 1712 [2022-12-14 06:32:58,802 INFO L226 Difference]: Without dead ends: 1712 [2022-12-14 06:32:58,803 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-12-14 06:32:58,803 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:58,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:32:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-12-14 06:32:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1384. [2022-12-14 06:32:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1356 states have (on average 2.7485250737463125) internal successors, (3727), 1383 states have internal predecessors, (3727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3727 transitions. [2022-12-14 06:32:58,831 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3727 transitions. Word has length 20 [2022-12-14 06:32:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:58,831 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 3727 transitions. [2022-12-14 06:32:58,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3727 transitions. [2022-12-14 06:32:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 06:32:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:58,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:58,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 06:32:58,832 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1528899927, now seen corresponding path program 1 times [2022-12-14 06:32:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:58,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891244069] [2022-12-14 06:32:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:58,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:32:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:32:59,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:32:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891244069] [2022-12-14 06:32:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891244069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:32:59,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:32:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:32:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172479824] [2022-12-14 06:32:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:32:59,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 06:32:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:32:59,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 06:32:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-14 06:32:59,180 INFO L87 Difference]: Start difference. First operand 1384 states and 3727 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:32:59,688 INFO L93 Difference]: Finished difference Result 3136 states and 8498 transitions. [2022-12-14 06:32:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:32:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 06:32:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:32:59,694 INFO L225 Difference]: With dead ends: 3136 [2022-12-14 06:32:59,694 INFO L226 Difference]: Without dead ends: 3136 [2022-12-14 06:32:59,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:32:59,694 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 500 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:32:59,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 46 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:32:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2022-12-14 06:32:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2214. [2022-12-14 06:32:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2186 states have (on average 2.8536139066788655) internal successors, (6238), 2213 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 6238 transitions. [2022-12-14 06:32:59,727 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 6238 transitions. Word has length 21 [2022-12-14 06:32:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:32:59,727 INFO L495 AbstractCegarLoop]: Abstraction has 2214 states and 6238 transitions. [2022-12-14 06:32:59,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:32:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 6238 transitions. [2022-12-14 06:32:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 06:32:59,728 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:32:59,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:32:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 06:32:59,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:32:59,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:32:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1528899926, now seen corresponding path program 1 times [2022-12-14 06:32:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:32:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649667840] [2022-12-14 06:32:59,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:32:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:00,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:00,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649667840] [2022-12-14 06:33:00,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649667840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:00,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:00,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 06:33:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3456388] [2022-12-14 06:33:00,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:00,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 06:33:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 06:33:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:33:00,210 INFO L87 Difference]: Start difference. First operand 2214 states and 6238 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:00,623 INFO L93 Difference]: Finished difference Result 2485 states and 6911 transitions. [2022-12-14 06:33:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:33:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 06:33:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:00,627 INFO L225 Difference]: With dead ends: 2485 [2022-12-14 06:33:00,627 INFO L226 Difference]: Without dead ends: 2485 [2022-12-14 06:33:00,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-12-14 06:33:00,628 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 122 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:00,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 59 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:33:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2022-12-14 06:33:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2419. [2022-12-14 06:33:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2391 states have (on average 2.838979506482643) internal successors, (6788), 2418 states have internal predecessors, (6788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 6788 transitions. [2022-12-14 06:33:00,656 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 6788 transitions. Word has length 21 [2022-12-14 06:33:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:00,656 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 6788 transitions. [2022-12-14 06:33:00,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 6788 transitions. [2022-12-14 06:33:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:33:00,657 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:00,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 06:33:00,658 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 356803148, now seen corresponding path program 1 times [2022-12-14 06:33:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375483649] [2022-12-14 06:33:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:01,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:01,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375483649] [2022-12-14 06:33:01,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375483649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:01,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:01,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 06:33:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509305644] [2022-12-14 06:33:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 06:33:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 06:33:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:01,016 INFO L87 Difference]: Start difference. First operand 2419 states and 6788 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:01,598 INFO L93 Difference]: Finished difference Result 3562 states and 9826 transitions. [2022-12-14 06:33:01,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:33:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:33:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:01,604 INFO L225 Difference]: With dead ends: 3562 [2022-12-14 06:33:01,605 INFO L226 Difference]: Without dead ends: 3562 [2022-12-14 06:33:01,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-12-14 06:33:01,605 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 528 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:01,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 46 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:33:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2022-12-14 06:33:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 2249. [2022-12-14 06:33:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2221 states have (on average 2.8442143178748314) internal successors, (6317), 2248 states have internal predecessors, (6317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 6317 transitions. [2022-12-14 06:33:01,636 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 6317 transitions. Word has length 22 [2022-12-14 06:33:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:01,636 INFO L495 AbstractCegarLoop]: Abstraction has 2249 states and 6317 transitions. [2022-12-14 06:33:01,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 6317 transitions. [2022-12-14 06:33:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:33:01,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:01,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:01,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 06:33:01,637 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 356803149, now seen corresponding path program 1 times [2022-12-14 06:33:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:01,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128100609] [2022-12-14 06:33:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:03,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:03,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128100609] [2022-12-14 06:33:03,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128100609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:03,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:03,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 06:33:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916113817] [2022-12-14 06:33:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 06:33:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 06:33:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:03,050 INFO L87 Difference]: Start difference. First operand 2249 states and 6317 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:04,856 INFO L93 Difference]: Finished difference Result 2579 states and 7190 transitions. [2022-12-14 06:33:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:33:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:33:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:04,861 INFO L225 Difference]: With dead ends: 2579 [2022-12-14 06:33:04,861 INFO L226 Difference]: Without dead ends: 2579 [2022-12-14 06:33:04,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-12-14 06:33:04,862 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 136 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:04,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 71 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 06:33:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2022-12-14 06:33:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2324. [2022-12-14 06:33:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2296 states have (on average 2.836236933797909) internal successors, (6512), 2323 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 6512 transitions. [2022-12-14 06:33:04,890 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 6512 transitions. Word has length 22 [2022-12-14 06:33:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:04,890 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 6512 transitions. [2022-12-14 06:33:04,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 6512 transitions. [2022-12-14 06:33:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 06:33:04,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:04,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 06:33:04,892 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -151254199, now seen corresponding path program 2 times [2022-12-14 06:33:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:04,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60824773] [2022-12-14 06:33:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:05,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:05,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60824773] [2022-12-14 06:33:05,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60824773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:05,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:05,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 06:33:05,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096056871] [2022-12-14 06:33:05,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:05,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 06:33:05,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:05,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 06:33:05,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:33:05,491 INFO L87 Difference]: Start difference. First operand 2324 states and 6512 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:05,975 INFO L93 Difference]: Finished difference Result 2415 states and 6687 transitions. [2022-12-14 06:33:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:33:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 06:33:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:05,979 INFO L225 Difference]: With dead ends: 2415 [2022-12-14 06:33:05,979 INFO L226 Difference]: Without dead ends: 2415 [2022-12-14 06:33:05,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-12-14 06:33:05,980 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 185 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:05,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 70 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:33:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-12-14 06:33:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2044. [2022-12-14 06:33:06,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2016 states have (on average 2.8551587301587302) internal successors, (5756), 2043 states have internal predecessors, (5756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 5756 transitions. [2022-12-14 06:33:06,017 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 5756 transitions. Word has length 22 [2022-12-14 06:33:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:06,017 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 5756 transitions. [2022-12-14 06:33:06,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 5756 transitions. [2022-12-14 06:33:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 06:33:06,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:06,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 06:33:06,018 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -974875033, now seen corresponding path program 1 times [2022-12-14 06:33:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632611478] [2022-12-14 06:33:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:06,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:06,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632611478] [2022-12-14 06:33:06,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632611478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:06,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:06,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:33:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464848543] [2022-12-14 06:33:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:06,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:06,062 INFO L87 Difference]: Start difference. First operand 2044 states and 5756 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:06,128 INFO L93 Difference]: Finished difference Result 886 states and 2306 transitions. [2022-12-14 06:33:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:06,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 06:33:06,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:06,130 INFO L225 Difference]: With dead ends: 886 [2022-12-14 06:33:06,130 INFO L226 Difference]: Without dead ends: 812 [2022-12-14 06:33:06,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:06,131 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:06,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-12-14 06:33:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 658. [2022-12-14 06:33:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 642 states have (on average 2.5576323987538943) internal successors, (1642), 657 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1642 transitions. [2022-12-14 06:33:06,139 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1642 transitions. Word has length 31 [2022-12-14 06:33:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:06,139 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1642 transitions. [2022-12-14 06:33:06,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1642 transitions. [2022-12-14 06:33:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 06:33:06,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:06,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:06,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 06:33:06,143 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -841433234, now seen corresponding path program 1 times [2022-12-14 06:33:06,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763158438] [2022-12-14 06:33:06,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:06,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:06,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763158438] [2022-12-14 06:33:06,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763158438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:06,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:06,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 06:33:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397506357] [2022-12-14 06:33:06,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:06,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 06:33:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:06,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 06:33:06,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:06,196 INFO L87 Difference]: Start difference. First operand 658 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:06,254 INFO L93 Difference]: Finished difference Result 458 states and 1006 transitions. [2022-12-14 06:33:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 06:33:06,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 06:33:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:06,255 INFO L225 Difference]: With dead ends: 458 [2022-12-14 06:33:06,255 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 06:33:06,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 06:33:06,255 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:06,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:33:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 06:33:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2022-12-14 06:33:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 2.2453703703703702) internal successors, (970), 439 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 970 transitions. [2022-12-14 06:33:06,261 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 970 transitions. Word has length 32 [2022-12-14 06:33:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:06,261 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 970 transitions. [2022-12-14 06:33:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 970 transitions. [2022-12-14 06:33:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:33:06,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:06,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 06:33:06,262 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1131581653, now seen corresponding path program 1 times [2022-12-14 06:33:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526226439] [2022-12-14 06:33:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:07,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:07,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526226439] [2022-12-14 06:33:07,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526226439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:07,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:07,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-14 06:33:07,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026824017] [2022-12-14 06:33:07,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:07,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 06:33:07,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:07,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 06:33:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-12-14 06:33:07,362 INFO L87 Difference]: Start difference. First operand 440 states and 970 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:08,360 INFO L93 Difference]: Finished difference Result 575 states and 1268 transitions. [2022-12-14 06:33:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 06:33:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 06:33:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:08,361 INFO L225 Difference]: With dead ends: 575 [2022-12-14 06:33:08,362 INFO L226 Difference]: Without dead ends: 575 [2022-12-14 06:33:08,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2022-12-14 06:33:08,362 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 149 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:08,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 97 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 06:33:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-12-14 06:33:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 554. [2022-12-14 06:33:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 546 states have (on average 2.2564102564102564) internal successors, (1232), 553 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1232 transitions. [2022-12-14 06:33:08,368 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1232 transitions. Word has length 33 [2022-12-14 06:33:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:08,368 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 1232 transitions. [2022-12-14 06:33:08,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 20 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1232 transitions. [2022-12-14 06:33:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:33:08,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:08,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:08,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 06:33:08,369 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1131581549, now seen corresponding path program 1 times [2022-12-14 06:33:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:08,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326359552] [2022-12-14 06:33:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:08,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:08,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326359552] [2022-12-14 06:33:08,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326359552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:08,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:08,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 06:33:08,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892172858] [2022-12-14 06:33:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:08,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 06:33:08,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 06:33:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 06:33:08,594 INFO L87 Difference]: Start difference. First operand 554 states and 1232 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:08,854 INFO L93 Difference]: Finished difference Result 757 states and 1673 transitions. [2022-12-14 06:33:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 06:33:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 06:33:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:08,855 INFO L225 Difference]: With dead ends: 757 [2022-12-14 06:33:08,855 INFO L226 Difference]: Without dead ends: 757 [2022-12-14 06:33:08,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-12-14 06:33:08,856 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 269 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:08,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 42 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:33:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-12-14 06:33:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 650. [2022-12-14 06:33:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 642 states have (on average 2.2523364485981308) internal successors, (1446), 649 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1446 transitions. [2022-12-14 06:33:08,863 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1446 transitions. Word has length 33 [2022-12-14 06:33:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:08,863 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1446 transitions. [2022-12-14 06:33:08,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1446 transitions. [2022-12-14 06:33:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:33:08,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:08,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 06:33:08,864 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1449575561, now seen corresponding path program 2 times [2022-12-14 06:33:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822892916] [2022-12-14 06:33:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:08,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:09,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:09,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822892916] [2022-12-14 06:33:09,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822892916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:09,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:09,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 06:33:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576750055] [2022-12-14 06:33:09,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:09,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 06:33:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 06:33:09,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:33:09,465 INFO L87 Difference]: Start difference. First operand 650 states and 1446 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:10,176 INFO L93 Difference]: Finished difference Result 718 states and 1589 transitions. [2022-12-14 06:33:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:33:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 06:33:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:10,177 INFO L225 Difference]: With dead ends: 718 [2022-12-14 06:33:10,177 INFO L226 Difference]: Without dead ends: 718 [2022-12-14 06:33:10,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2022-12-14 06:33:10,178 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 340 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:10,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 52 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:33:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-12-14 06:33:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 604. [2022-12-14 06:33:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 2.2449664429530203) internal successors, (1338), 603 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1338 transitions. [2022-12-14 06:33:10,184 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1338 transitions. Word has length 33 [2022-12-14 06:33:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1338 transitions. [2022-12-14 06:33:10,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1338 transitions. [2022-12-14 06:33:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:33:10,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:10,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:10,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 06:33:10,185 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1449575457, now seen corresponding path program 2 times [2022-12-14 06:33:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:10,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798089491] [2022-12-14 06:33:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:11,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798089491] [2022-12-14 06:33:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798089491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:11,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:11,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-14 06:33:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068059560] [2022-12-14 06:33:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 06:33:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 06:33:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-12-14 06:33:11,160 INFO L87 Difference]: Start difference. First operand 604 states and 1338 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:11,973 INFO L93 Difference]: Finished difference Result 604 states and 1338 transitions. [2022-12-14 06:33:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 06:33:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 06:33:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:11,975 INFO L225 Difference]: With dead ends: 604 [2022-12-14 06:33:11,975 INFO L226 Difference]: Without dead ends: 604 [2022-12-14 06:33:11,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-12-14 06:33:11,976 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 224 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:11,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 64 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 06:33:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-12-14 06:33:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 500. [2022-12-14 06:33:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 493 states have (on average 2.2454361054766734) internal successors, (1107), 499 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1107 transitions. [2022-12-14 06:33:11,981 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1107 transitions. Word has length 33 [2022-12-14 06:33:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:11,982 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 1107 transitions. [2022-12-14 06:33:11,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1107 transitions. [2022-12-14 06:33:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 06:33:11,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:11,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:11,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 06:33:11,982 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash 250335073, now seen corresponding path program 1 times [2022-12-14 06:33:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:11,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939555098] [2022-12-14 06:33:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:12,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:12,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939555098] [2022-12-14 06:33:12,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939555098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:12,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:12,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 06:33:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71216684] [2022-12-14 06:33:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:12,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 06:33:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 06:33:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-12-14 06:33:12,905 INFO L87 Difference]: Start difference. First operand 500 states and 1107 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:13,466 INFO L93 Difference]: Finished difference Result 714 states and 1583 transitions. [2022-12-14 06:33:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:33:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 06:33:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:13,467 INFO L225 Difference]: With dead ends: 714 [2022-12-14 06:33:13,467 INFO L226 Difference]: Without dead ends: 714 [2022-12-14 06:33:13,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-12-14 06:33:13,468 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 333 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:13,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 63 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:33:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-12-14 06:33:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 652. [2022-12-14 06:33:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 645 states have (on average 2.316279069767442) internal successors, (1494), 651 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1494 transitions. [2022-12-14 06:33:13,474 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1494 transitions. Word has length 36 [2022-12-14 06:33:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:13,475 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 1494 transitions. [2022-12-14 06:33:13,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1494 transitions. [2022-12-14 06:33:13,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 06:33:13,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:13,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:13,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 06:33:13,476 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash 250335107, now seen corresponding path program 1 times [2022-12-14 06:33:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:13,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354830428] [2022-12-14 06:33:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:27,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354830428] [2022-12-14 06:33:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354830428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:27,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-14 06:33:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046830144] [2022-12-14 06:33:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:27,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 06:33:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 06:33:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2022-12-14 06:33:27,451 INFO L87 Difference]: Start difference. First operand 652 states and 1494 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:51,078 INFO L93 Difference]: Finished difference Result 786 states and 1783 transitions. [2022-12-14 06:33:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 06:33:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 06:33:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:51,079 INFO L225 Difference]: With dead ends: 786 [2022-12-14 06:33:51,079 INFO L226 Difference]: Without dead ends: 745 [2022-12-14 06:33:51,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-12-14 06:33:51,080 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 153 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:51,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 54 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2022-12-14 06:33:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-12-14 06:33:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 741. [2022-12-14 06:33:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 734 states have (on average 2.29291553133515) internal successors, (1683), 740 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1683 transitions. [2022-12-14 06:33:51,087 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1683 transitions. Word has length 36 [2022-12-14 06:33:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:51,087 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1683 transitions. [2022-12-14 06:33:51,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1683 transitions. [2022-12-14 06:33:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 06:33:51,088 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:51,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:51,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 06:33:51,088 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:51,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1591676855, now seen corresponding path program 2 times [2022-12-14 06:33:51,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:51,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981782324] [2022-12-14 06:33:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:52,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:52,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981782324] [2022-12-14 06:33:52,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981782324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:33:52,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:33:52,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 06:33:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354011125] [2022-12-14 06:33:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:33:52,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 06:33:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:52,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 06:33:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-12-14 06:33:52,036 INFO L87 Difference]: Start difference. First operand 741 states and 1683 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:33:52,503 INFO L93 Difference]: Finished difference Result 617 states and 1351 transitions. [2022-12-14 06:33:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:33:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 06:33:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:33:52,504 INFO L225 Difference]: With dead ends: 617 [2022-12-14 06:33:52,504 INFO L226 Difference]: Without dead ends: 575 [2022-12-14 06:33:52,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:33:52,505 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 123 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:33:52,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 50 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:33:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-12-14 06:33:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 482. [2022-12-14 06:33:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 475 states have (on average 2.231578947368421) internal successors, (1060), 481 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1060 transitions. [2022-12-14 06:33:52,510 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1060 transitions. Word has length 36 [2022-12-14 06:33:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:33:52,510 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 1060 transitions. [2022-12-14 06:33:52,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:33:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1060 transitions. [2022-12-14 06:33:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 06:33:52,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:33:52,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:33:52,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 06:33:52,511 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:33:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:33:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash -527647439, now seen corresponding path program 1 times [2022-12-14 06:33:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:33:52,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828862065] [2022-12-14 06:33:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:52,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:33:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:54,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:33:54,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828862065] [2022-12-14 06:33:54,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828862065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:33:54,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791316238] [2022-12-14 06:33:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:33:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:33:54,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:33:54,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:33:54,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:33:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:54,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 06:33:54,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:33:54,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:33:54,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:33:54,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:33:54,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:33:55,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:33:55,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-12-14 06:33:55,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:33:55,204 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 06:33:55,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 06:33:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:55,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:33:56,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:33:56,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 66 [2022-12-14 06:33:56,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:33:56,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2022-12-14 06:33:56,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-12-14 06:33:56,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-14 06:33:56,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:33:56,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2022-12-14 06:33:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:33:56,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791316238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:33:56,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [60194917] [2022-12-14 06:33:56,502 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:33:56,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:33:56,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 49 [2022-12-14 06:33:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901919590] [2022-12-14 06:33:56,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:33:56,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 06:33:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:33:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 06:33:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=2191, Unknown=9, NotChecked=0, Total=2550 [2022-12-14 06:33:56,506 INFO L87 Difference]: Start difference. First operand 482 states and 1060 transitions. Second operand has 51 states, 50 states have (on average 2.76) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:01,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:34:03,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:34:05,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:34:07,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:34:09,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:34:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:09,951 INFO L93 Difference]: Finished difference Result 954 states and 2129 transitions. [2022-12-14 06:34:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 06:34:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.76) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-14 06:34:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:09,953 INFO L225 Difference]: With dead ends: 954 [2022-12-14 06:34:09,953 INFO L226 Difference]: Without dead ends: 954 [2022-12-14 06:34:09,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1139, Invalid=5658, Unknown=9, NotChecked=0, Total=6806 [2022-12-14 06:34:09,954 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1054 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 2849 mSolverCounterSat, 154 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2849 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:09,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 278 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2849 Invalid, 6 Unknown, 0 Unchecked, 11.8s Time] [2022-12-14 06:34:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-12-14 06:34:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 602. [2022-12-14 06:34:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 595 states have (on average 2.2403361344537815) internal successors, (1333), 601 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1333 transitions. [2022-12-14 06:34:09,961 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1333 transitions. Word has length 46 [2022-12-14 06:34:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:09,961 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 1333 transitions. [2022-12-14 06:34:09,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.76) internal successors, (138), 50 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1333 transitions. [2022-12-14 06:34:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 06:34:09,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:09,962 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:09,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:34:10,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 06:34:10,164 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:34:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash -527647402, now seen corresponding path program 1 times [2022-12-14 06:34:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:10,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757545512] [2022-12-14 06:34:10,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:11,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:11,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757545512] [2022-12-14 06:34:11,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757545512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:11,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21273392] [2022-12-14 06:34:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:11,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:11,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:11,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:34:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:12,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-14 06:34:12,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:12,133 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 06:34:12,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 06:34:12,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2022-12-14 06:34:12,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:12,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-14 06:34:12,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-14 06:34:12,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:34:12,544 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 06:34:12,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 06:34:12,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-12-14 06:34:12,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-14 06:34:12,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:12,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-12-14 06:34:12,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:12,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:34:12,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-12-14 06:34:13,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-12-14 06:34:13,139 INFO L321 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-12-14 06:34:13,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-12-14 06:34:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:13,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:17,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1621 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1623) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1618 1))))) is different from false [2022-12-14 06:34:17,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1621 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1618 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1623) .cse1) 2147483647)))) is different from false [2022-12-14 06:34:17,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1621 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_1623) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1618 1))))) is different from false [2022-12-14 06:34:17,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1613) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_1613 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select .cse0 .cse1) (+ v_ArrVal_1618 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_1623) .cse1) 2147483647)))) is different from false [2022-12-14 06:34:17,524 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1611 Int) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1611)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1613) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1618 1)) (< 2147483647 v_ArrVal_1613) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_1623) .cse1) 2147483647)))) is different from false [2022-12-14 06:34:18,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 Int) (v_ArrVal_1610 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1609 (Array Int Int)) (v_ArrVal_1621 Int) (v_ArrVal_1613 Int) (v_ArrVal_1623 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1610))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1611)))) (store (store .cse4 .cse1 v_ArrVal_1613) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1618 1)) (< 2147483647 v_ArrVal_1613) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1618) (+ 1600 |c_~#queue~0.offset|) v_ArrVal_1621) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_1623) .cse1) 2147483647))))) is different from false [2022-12-14 06:34:18,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:18,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 569 treesize of output 305 [2022-12-14 06:34:18,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:18,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1292 treesize of output 1274 [2022-12-14 06:34:18,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:18,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1259 treesize of output 1163 [2022-12-14 06:34:18,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 858 treesize of output 842 [2022-12-14 06:34:18,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 690 treesize of output 658 [2022-12-14 06:34:18,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 06:34:18,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:18,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 80 [2022-12-14 06:34:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:34:18,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21273392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:18,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082369351] [2022-12-14 06:34:18,884 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:34:18,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:34:18,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 66 [2022-12-14 06:34:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645069167] [2022-12-14 06:34:18,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:34:18,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-14 06:34:18,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:18,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-14 06:34:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=3329, Unknown=28, NotChecked=750, Total=4556 [2022-12-14 06:34:18,887 INFO L87 Difference]: Start difference. First operand 602 states and 1333 transitions. Second operand has 68 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 67 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:27,912 INFO L93 Difference]: Finished difference Result 858 states and 1905 transitions. [2022-12-14 06:34:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 06:34:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 67 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-14 06:34:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:27,914 INFO L225 Difference]: With dead ends: 858 [2022-12-14 06:34:27,914 INFO L226 Difference]: Without dead ends: 858 [2022-12-14 06:34:27,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 14 SemanticMatches, 101 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1677, Invalid=7631, Unknown=28, NotChecked=1170, Total=10506 [2022-12-14 06:34:27,915 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1683 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 4361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 971 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:27,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 278 Invalid, 4361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3063 Invalid, 0 Unknown, 971 Unchecked, 2.2s Time] [2022-12-14 06:34:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-12-14 06:34:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 704. [2022-12-14 06:34:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 698 states have (on average 2.286532951289398) internal successors, (1596), 703 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1596 transitions. [2022-12-14 06:34:27,922 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1596 transitions. Word has length 46 [2022-12-14 06:34:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:27,922 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1596 transitions. [2022-12-14 06:34:27,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 67 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1596 transitions. [2022-12-14 06:34:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 06:34:27,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:27,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:27,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 06:34:28,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 06:34:28,125 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:34:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1863564327, now seen corresponding path program 2 times [2022-12-14 06:34:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:28,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145906747] [2022-12-14 06:34:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:28,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145906747] [2022-12-14 06:34:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145906747] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:28,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655415722] [2022-12-14 06:34:28,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:34:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:28,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:28,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:34:28,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:34:28,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:34:28,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 06:34:28,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:28,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:34:28,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:28,899 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 06:34:28,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 06:34:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:28,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:29,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:29,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-12-14 06:34:29,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:29,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-12-14 06:34:29,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-14 06:34:29,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:29,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-12-14 06:34:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655415722] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:29,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 06:34:29,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 22 [2022-12-14 06:34:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298939967] [2022-12-14 06:34:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:34:29,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:34:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:29,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:34:29,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2022-12-14 06:34:29,141 INFO L87 Difference]: Start difference. First operand 704 states and 1596 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:29,510 INFO L93 Difference]: Finished difference Result 723 states and 1633 transitions. [2022-12-14 06:34:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 06:34:29,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-14 06:34:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:29,511 INFO L225 Difference]: With dead ends: 723 [2022-12-14 06:34:29,511 INFO L226 Difference]: Without dead ends: 723 [2022-12-14 06:34:29,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-12-14 06:34:29,512 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 109 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:29,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 42 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:34:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-12-14 06:34:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 578. [2022-12-14 06:34:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 573 states have (on average 2.2966841186736473) internal successors, (1316), 577 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1316 transitions. [2022-12-14 06:34:29,518 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1316 transitions. Word has length 46 [2022-12-14 06:34:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:29,518 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 1316 transitions. [2022-12-14 06:34:29,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1316 transitions. [2022-12-14 06:34:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 06:34:29,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:29,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:29,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:34:29,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:29,720 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:34:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 437636861, now seen corresponding path program 1 times [2022-12-14 06:34:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017935977] [2022-12-14 06:34:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:31,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017935977] [2022-12-14 06:34:31,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017935977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:31,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123835204] [2022-12-14 06:34:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:31,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:31,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:31,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:34:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:31,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 06:34:31,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:31,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:34:31,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:31,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:34:31,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:31,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:32,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:32,085 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 06:34:32,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 06:34:32,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:32,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:32,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:32,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 06:34:32,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:32,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-12-14 06:34:32,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 06:34:32,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-14 06:34:32,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:32,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-12-14 06:34:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:32,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123835204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567017848] [2022-12-14 06:34:32,971 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:34:32,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:34:32,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9, 9] total 41 [2022-12-14 06:34:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580183245] [2022-12-14 06:34:32,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:34:32,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 06:34:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:32,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 06:34:32,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1574, Unknown=9, NotChecked=0, Total=1806 [2022-12-14 06:34:32,974 INFO L87 Difference]: Start difference. First operand 578 states and 1316 transitions. Second operand has 43 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:36,785 INFO L93 Difference]: Finished difference Result 1084 states and 2439 transitions. [2022-12-14 06:34:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 06:34:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 06:34:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:36,786 INFO L225 Difference]: With dead ends: 1084 [2022-12-14 06:34:36,786 INFO L226 Difference]: Without dead ends: 1066 [2022-12-14 06:34:36,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=815, Invalid=4288, Unknown=9, NotChecked=0, Total=5112 [2022-12-14 06:34:36,787 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 949 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 3033 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:36,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 284 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 3033 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 06:34:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-12-14 06:34:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 851. [2022-12-14 06:34:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 846 states have (on average 2.2635933806146573) internal successors, (1915), 850 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1915 transitions. [2022-12-14 06:34:36,796 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1915 transitions. Word has length 49 [2022-12-14 06:34:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:36,796 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1915 transitions. [2022-12-14 06:34:36,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.5) internal successors, (147), 42 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1915 transitions. [2022-12-14 06:34:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 06:34:36,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:36,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:36,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 06:34:36,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:36,998 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:34:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -695408811, now seen corresponding path program 2 times [2022-12-14 06:34:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:37,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357296257] [2022-12-14 06:34:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:37,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357296257] [2022-12-14 06:34:37,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357296257] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438084208] [2022-12-14 06:34:37,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 06:34:37,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:37,787 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:37,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:34:37,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 06:34:37,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 06:34:37,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 06:34:37,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:37,985 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 06:34:37,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 06:34:38,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:34:38,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:38,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:34:38,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:34:38,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:38,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:38,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:38,436 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 06:34:38,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 06:34:38,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:34:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:38,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:38,846 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_2037 Int) (v_ArrVal_2032 (Array Int Int))) (or (< (+ v_ArrVal_2037 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2032) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_2037) (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-12-14 06:34:38,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:38,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 06:34:38,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:38,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 112 [2022-12-14 06:34:38,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-12-14 06:34:38,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2022-12-14 06:34:38,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-14 06:34:39,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:34:39,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2022-12-14 06:34:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438084208] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [9442522] [2022-12-14 06:34:39,193 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:34:39,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:34:39,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-14 06:34:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405551829] [2022-12-14 06:34:39,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:34:39,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 06:34:39,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:39,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 06:34:39,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=860, Unknown=7, NotChecked=60, Total=1056 [2022-12-14 06:34:39,196 INFO L87 Difference]: Start difference. First operand 851 states and 1915 transitions. Second operand has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:34:40,002 INFO L93 Difference]: Finished difference Result 845 states and 1902 transitions. [2022-12-14 06:34:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 06:34:40,003 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 06:34:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:34:40,004 INFO L225 Difference]: With dead ends: 845 [2022-12-14 06:34:40,004 INFO L226 Difference]: Without dead ends: 845 [2022-12-14 06:34:40,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=391, Invalid=1328, Unknown=7, NotChecked=80, Total=1806 [2022-12-14 06:34:40,005 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 573 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:34:40,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 73 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 672 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2022-12-14 06:34:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-12-14 06:34:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 707. [2022-12-14 06:34:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 703 states have (on average 2.264580369843528) internal successors, (1592), 706 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1592 transitions. [2022-12-14 06:34:40,013 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1592 transitions. Word has length 49 [2022-12-14 06:34:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:34:40,013 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 1592 transitions. [2022-12-14 06:34:40,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:34:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1592 transitions. [2022-12-14 06:34:40,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 06:34:40,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:34:40,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:34:40,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:34:40,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 06:34:40,215 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:34:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:34:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash -695408810, now seen corresponding path program 1 times [2022-12-14 06:34:40,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:34:40,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616940196] [2022-12-14 06:34:40,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:34:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:41,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:34:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616940196] [2022-12-14 06:34:41,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616940196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:34:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217681547] [2022-12-14 06:34:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:34:41,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:34:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:34:41,572 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:34:41,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 06:34:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:34:41,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 124 conjunts are in the unsatisfiable core [2022-12-14 06:34:41,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:34:41,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:41,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:41,789 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 06:34:41,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 06:34:41,800 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 06:34:41,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 06:34:41,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 06:34:41,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-14 06:34:42,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-12-14 06:34:42,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:42,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-12-14 06:34:42,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-12-14 06:34:42,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 149 [2022-12-14 06:34:42,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 117 [2022-12-14 06:34:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:34:42,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 219 [2022-12-14 06:34:42,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 219 [2022-12-14 06:34:43,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 219 [2022-12-14 06:34:43,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 219 [2022-12-14 06:34:43,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 230 [2022-12-14 06:34:43,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 333 [2022-12-14 06:34:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:34:43,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:34:44,028 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2205)) .cse1)) 2147483647)) is different from false [2022-12-14 06:34:44,035 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2205)) .cse1)) 2147483647)) is different from false [2022-12-14 06:34:44,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2205)) .cse1)) 2147483647)) is different from false [2022-12-14 06:34:46,687 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2196 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse1))) v_ArrVal_2193)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647) (= 400 .cse4)))))) is different from false [2022-12-14 06:34:46,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2196 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2193)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2205)) .cse1) 2147483647) (= 400 .cse4)))))) is different from false [2022-12-14 06:34:46,876 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2196 Int) (v_ArrVal_2188 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2188) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2193)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2205)) .cse1) 2147483647) (= 400 .cse4)))))) (= 400 .cse8)))) is different from false [2022-12-14 06:34:46,910 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2186 Int) (v_ArrVal_2196 Int) (v_ArrVal_2188 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2186)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2188) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) v_ArrVal_2193)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 400) (< (select (let ((.cse1 (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2205)) .cse2) 2147483647) (= 400 .cse5)))))))) is different from false [2022-12-14 06:34:46,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (v_ArrVal_2196 Int) (v_ArrVal_2188 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse9 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4)) v_ArrVal_2186)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (select .cse9 .cse7))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_2188) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse3 (let ((.cse8 (select .cse2 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2193)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2205)) .cse1) 2147483647) (= 400 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| (select .cse6 .cse7))) (= .cse4 400))))))))) is different from false [2022-12-14 06:34:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 06:34:47,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217681547] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:34:47,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [423646284] [2022-12-14 06:34:47,200 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:34:47,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:34:47,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 21] total 55 [2022-12-14 06:34:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096513427] [2022-12-14 06:34:47,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:34:47,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-14 06:34:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:34:47,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-14 06:34:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1969, Unknown=43, NotChecked=808, Total=3192 [2022-12-14 06:34:47,203 INFO L87 Difference]: Start difference. First operand 707 states and 1592 transitions. Second operand has 57 states, 56 states have (on average 2.625) internal successors, (147), 56 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:06,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2186 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| Int) (v_ArrVal_2196 Int) (v_ArrVal_2188 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse9 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| 4) |c_~#queue~0.offset|) v_ArrVal_2186))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (select .cse9 .cse1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2188) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse1) 4)) v_ArrVal_2193)))) (let ((.cse3 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_222| (select .cse0 .cse1))) (= 400 .cse2) (= 400 .cse3) (< (select (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2196) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2205)) .cse1) 2147483647)))))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| 4)) (exists ((v_ArrVal_2186 Int) (v_ArrVal_2188 Int) (v_ArrVal_2203 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_217| Int) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (and (= .cse10 (let ((.cse14 (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (let ((.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse15 (store (store (store (store ((as const (Array Int Int)) 0) .cse14 0) .cse12 0) .cse16 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_217| 4)) v_ArrVal_2186))) (let ((.cse17 (select .cse15 .cse12))) (store (store (store .cse15 .cse16 v_ArrVal_2188) .cse12 (+ .cse17 1)) (+ (* 4 .cse17) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2193)))))) (let ((.cse13 (select .cse11 .cse12))) (store (store (store .cse11 .cse12 (+ .cse13 1)) .cse14 v_ArrVal_2203) (+ (* .cse13 4) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2205))))) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_217| 0))) (= |c_~#queue~0.offset| 0) (<= (select (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|) 1604) 2) (let ((.cse19 (select .cse10 .cse12))) (or (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (select (let ((.cse18 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse12 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647)) (= 400 .cse19))) (= |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 0) (let ((.cse20 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not .cse20) (<= (select .cse0 1604) 2)) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 1604) 2) .cse20 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2205 Int)) (< (select (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647)) (= |c_~#queue~0.base| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|))) is different from false [2022-12-14 06:35:07,821 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2205 Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2205)) .cse1) 2147483647)) (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2205 Int)) (< (select (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647)))) is different from false [2022-12-14 06:35:08,109 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse13 (select .cse10 .cse11))) (let ((.cse12 (+ .cse13 1))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 .cse12))) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (= 400 .cse13))) (and (or (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (select (let ((.cse0 (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647)) .cse3) (or (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2196 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int) (v_ArrVal_2193 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_2192))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2193)))) (let ((.cse7 (select .cse6 .cse1))) (or (< (select (let ((.cse4 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_2196) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse1))) v_ArrVal_2205)) .cse1) 2147483647) (= 400 .cse7)))))) .cse3) (or (forall ((v_ArrVal_2196 Int) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int)) (v_ArrVal_2205 Int)) (< (select (let ((.cse9 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2196) .cse11 .cse12)) |c_~#stored_elements~0.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2200) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_2205)) .cse1) 2147483647)) .cse3) (< .cse13 2147483647)))))) is different from false [2022-12-14 06:35:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:35:08,151 INFO L93 Difference]: Finished difference Result 904 states and 2032 transitions. [2022-12-14 06:35:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 06:35:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.625) internal successors, (147), 56 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 06:35:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:35:08,153 INFO L225 Difference]: With dead ends: 904 [2022-12-14 06:35:08,153 INFO L226 Difference]: Without dead ends: 880 [2022-12-14 06:35:08,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 59 SyntacticMatches, 11 SemanticMatches, 86 ConstructedPredicates, 11 IntricatePredicates, 3 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1009, Invalid=4744, Unknown=143, NotChecked=1760, Total=7656 [2022-12-14 06:35:08,155 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1126 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 178 mSolverCounterUnsat, 210 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 210 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:35:08,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 230 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2281 Invalid, 210 Unknown, 1411 Unchecked, 7.4s Time] [2022-12-14 06:35:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2022-12-14 06:35:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 628. [2022-12-14 06:35:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 624 states have (on average 2.280448717948718) internal successors, (1423), 627 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1423 transitions. [2022-12-14 06:35:08,163 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1423 transitions. Word has length 49 [2022-12-14 06:35:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:35:08,163 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 1423 transitions. [2022-12-14 06:35:08,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.625) internal successors, (147), 56 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1423 transitions. [2022-12-14 06:35:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-14 06:35:08,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:35:08,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:35:08,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 06:35:08,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 06:35:08,366 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:35:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:35:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 45606550, now seen corresponding path program 1 times [2022-12-14 06:35:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:35:08,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473234902] [2022-12-14 06:35:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:35:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:09,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:35:09,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473234902] [2022-12-14 06:35:09,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473234902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:35:09,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158234228] [2022-12-14 06:35:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:35:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:35:09,192 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:35:09,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 06:35:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:09,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 06:35:09,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:35:09,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:35:09,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:35:09,674 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-12-14 06:35:09,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 36 [2022-12-14 06:35:09,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 06:35:09,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-12-14 06:35:09,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 06:35:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:09,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:35:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:09,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:35:09,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2365 (Array Int Int))) (<= 0 (+ 2147483647 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|))))) is different from false [2022-12-14 06:35:11,999 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2362 Int) (v_ArrVal_2364 Int) (v_ArrVal_2365 (Array Int Int))) (or (<= 0 (+ 2147483647 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2362) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2364)) |c_~#stored_elements~0.base| v_ArrVal_2365) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)))) (not (<= (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1) v_ArrVal_2362)))) is different from false [2022-12-14 06:35:19,317 INFO L321 Elim1Store]: treesize reduction 226, result has 41.5 percent of original size [2022-12-14 06:35:19,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 206 [2022-12-14 06:35:19,338 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-14 06:35:19,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 143 [2022-12-14 06:35:19,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:35:19,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 215 [2022-12-14 06:35:19,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-12-14 06:35:19,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:35:19,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-12-14 06:35:19,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-14 06:35:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 06:35:23,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158234228] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:35:23,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [918192461] [2022-12-14 06:35:23,693 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:35:23,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:35:23,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 37 [2022-12-14 06:35:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378365873] [2022-12-14 06:35:23,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:35:23,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 06:35:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:35:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 06:35:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1098, Unknown=11, NotChecked=142, Total=1482 [2022-12-14 06:35:23,695 INFO L87 Difference]: Start difference. First operand 628 states and 1423 transitions. Second operand has 39 states, 38 states have (on average 4.605263157894737) internal successors, (175), 38 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:35:24,972 INFO L93 Difference]: Finished difference Result 620 states and 1402 transitions. [2022-12-14 06:35:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 06:35:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 4.605263157894737) internal successors, (175), 38 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-12-14 06:35:24,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:35:24,973 INFO L225 Difference]: With dead ends: 620 [2022-12-14 06:35:24,973 INFO L226 Difference]: Without dead ends: 620 [2022-12-14 06:35:24,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=472, Invalid=1687, Unknown=11, NotChecked=182, Total=2352 [2022-12-14 06:35:24,974 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 482 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 06:35:24,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 188 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1303 Invalid, 0 Unknown, 254 Unchecked, 0.9s Time] [2022-12-14 06:35:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-12-14 06:35:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-12-14 06:35:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 617 states have (on average 2.272285251215559) internal successors, (1402), 619 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1402 transitions. [2022-12-14 06:35:24,979 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1402 transitions. Word has length 59 [2022-12-14 06:35:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:35:24,980 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1402 transitions. [2022-12-14 06:35:24,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.605263157894737) internal successors, (175), 38 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1402 transitions. [2022-12-14 06:35:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:35:24,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:35:24,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:35:24,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 06:35:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 06:35:25,182 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:35:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:35:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1456118806, now seen corresponding path program 1 times [2022-12-14 06:35:25,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:35:25,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466749100] [2022-12-14 06:35:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:35:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:26,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:35:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466749100] [2022-12-14 06:35:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466749100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:35:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164543017] [2022-12-14 06:35:26,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:26,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:35:26,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:35:26,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:35:26,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 06:35:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:26,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 06:35:26,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:35:26,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:35:26,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 06:35:26,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:35:26,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 06:35:26,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:26,610 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-14 06:35:26,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 50 [2022-12-14 06:35:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:26,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:26,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-12-14 06:35:26,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2022-12-14 06:35:26,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:26,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 06:35:26,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:26,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 06:35:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:26,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:35:39,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 06:35:39,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 110 [2022-12-14 06:35:39,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 173 [2022-12-14 06:35:39,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 74 [2022-12-14 06:35:39,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2022-12-14 06:35:39,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2022-12-14 06:35:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:44,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164543017] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:35:44,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [693255016] [2022-12-14 06:35:44,083 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:35:44,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:35:44,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 34 [2022-12-14 06:35:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356909996] [2022-12-14 06:35:44,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:35:44,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 06:35:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:35:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 06:35:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=987, Unknown=28, NotChecked=0, Total=1260 [2022-12-14 06:35:44,085 INFO L87 Difference]: Start difference. First operand 620 states and 1402 transitions. Second operand has 36 states, 35 states have (on average 5.314285714285714) internal successors, (186), 35 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:35:45,722 INFO L93 Difference]: Finished difference Result 666 states and 1474 transitions. [2022-12-14 06:35:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 06:35:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.314285714285714) internal successors, (186), 35 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-12-14 06:35:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:35:45,723 INFO L225 Difference]: With dead ends: 666 [2022-12-14 06:35:45,724 INFO L226 Difference]: Without dead ends: 666 [2022-12-14 06:35:45,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=556, Invalid=1486, Unknown=28, NotChecked=0, Total=2070 [2022-12-14 06:35:45,724 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 347 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:35:45,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 157 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 06:35:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-12-14 06:35:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 612. [2022-12-14 06:35:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 610 states have (on average 2.263934426229508) internal successors, (1381), 611 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-12-14 06:35:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1381 transitions. [2022-12-14 06:35:45,730 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1381 transitions. Word has length 62 [2022-12-14 06:35:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:35:45,730 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 1381 transitions. [2022-12-14 06:35:45,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.314285714285714) internal successors, (186), 35 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:35:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1381 transitions. [2022-12-14 06:35:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:35:45,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:35:45,731 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:35:45,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 06:35:45,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 06:35:45,933 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-12-14 06:35:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:35:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1456118840, now seen corresponding path program 1 times [2022-12-14 06:35:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:35:45,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389739855] [2022-12-14 06:35:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:35:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:35:48,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:35:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389739855] [2022-12-14 06:35:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389739855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:35:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894895768] [2022-12-14 06:35:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:35:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:35:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:35:48,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:35:48,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0ff8636-1905-427c-97d4-b1f4c017ebcb/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 06:35:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:35:48,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 125 conjunts are in the unsatisfiable core [2022-12-14 06:35:48,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:35:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:48,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:48,324 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 06:35:48,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 06:35:48,337 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 06:35:48,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 06:35:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 06:35:48,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-14 06:35:48,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 06:35:48,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:48,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 06:35:48,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 06:35:49,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 06:35:49,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 06:35:49,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-12-14 06:35:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:35:49,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2022-12-14 06:35:50,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 59 [2022-12-14 06:35:50,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-12-14 06:35:51,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-12-14 06:35:55,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2022-12-14 06:36:04,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2022-12-14 06:36:10,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 06:36:10,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2022-12-14 06:36:20,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2022-12-14 06:36:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:36:27,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:36:27,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-12-14 06:37:09,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_2709 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse3 v_ArrVal_2712) .cse4 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse3 v_ArrVal_2718)) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_2714))))) is different from false [2022-12-14 06:37:09,492 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2709) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_2712) .cse6 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse5 v_ArrVal_2718)) .cse3 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse6) 2147483647) (< (+ (select .cse2 .cse6) 1) v_ArrVal_2714)))))) is different from false [2022-12-14 06:37:09,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2709) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse2 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse2 .cse5 v_ArrVal_2712) .cse6 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse5 v_ArrVal_2718)) .cse3 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse6) 2147483647) (< (+ (select .cse2 .cse6) 1) v_ArrVal_2714)))))) is different from false [2022-12-14 06:37:09,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2706)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2707) .cse3 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2709) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (let ((.cse5 (+ 1608 |c_~#queue~0.offset|))) (store (store (store (store .cse0 .cse5 v_ArrVal_2712) .cse6 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse5 v_ArrVal_2718)) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse6) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_2714)))))) is different from false [2022-12-14 06:37:30,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_2707) .cse4 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2714) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse3 v_ArrVal_2712) .cse1 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse3 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse1) 2147483647) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_2709) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse0 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse6 .cse4)))))))))) is different from false [2022-12-14 06:37:30,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2709) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse4 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse6 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse6 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647)))))))) is different from false [2022-12-14 06:37:31,033 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2701 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2701)) |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (< (+ (select .cse0 .cse2) 1) v_ArrVal_2714) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2709) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse5 v_ArrVal_2712) .cse2 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse5 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= v_ArrVal_2701 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse6 .cse1)))))))))) is different from false [2022-12-14 06:37:31,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2701 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2701)) |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse0 .cse1))) (< (+ (select .cse0 .cse2) 1) v_ArrVal_2714) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2701) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2709) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse0 .cse7 v_ArrVal_2712) .cse2 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse7 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse8 .cse1))))))))))) is different from false [2022-12-14 06:37:31,180 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2700 Int) (v_ArrVal_2701 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2700) .cse5 v_ArrVal_2701)) |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2709) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse2 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2714) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2701) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store (store .cse2 .cse7 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse7 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse8 .cse1))))))))))) is different from false [2022-12-14 06:37:31,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2698 Int) (v_ArrVal_2720 Int) (v_ArrVal_2700 Int) (v_ArrVal_2701 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2698)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2700) .cse7 v_ArrVal_2701)) |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store (store .cse3 .cse4 v_ArrVal_2712) .cse5 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse4 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse5) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2701) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2709) (< (+ (select .cse3 .cse5) 1) v_ArrVal_2714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse3 .cse1))))))))))) is different from false [2022-12-14 06:37:31,352 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2704 (Array Int Int)) (v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_245| Int) (v_ArrVal_2698 Int) (v_ArrVal_2720 Int) (v_ArrVal_2700 Int) (v_ArrVal_2701 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_245| 4)) v_ArrVal_2698)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 1604))) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_2700) .cse4 v_ArrVal_2701)) |c_~#stored_elements~0.base| v_ArrVal_2703) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2704))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2707) .cse1 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ 1600 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2709) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2701) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse5 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2714) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_245| (select .cse7 .cse4))) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse9 v_ArrVal_2712) .cse6 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse9 v_ArrVal_2718) .cse1 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse6) 2147483647)))))))))) is different from false [2022-12-14 06:37:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-14 06:37:40,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894895768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:37:40,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835895573] [2022-12-14 06:37:40,276 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 06:37:40,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:37:40,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 70 [2022-12-14 06:37:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97840476] [2022-12-14 06:37:40,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:37:40,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-14 06:37:40,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:37:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-14 06:37:40,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=2722, Unknown=74, NotChecked=1524, Total=5112 [2022-12-14 06:37:40,278 INFO L87 Difference]: Start difference. First operand 612 states and 1381 transitions. Second operand has 72 states, 71 states have (on average 2.619718309859155) internal successors, (186), 71 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 06:37:51,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:37:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:37:57,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:38:05,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:38:07,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 06:38:11,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:21,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:23,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:25,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:27,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:29,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:31,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:33,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:35,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:37,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:39,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:41,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:43,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:38:45,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:08,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:10,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:12,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:14,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:16,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:18,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:20,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:22,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:24,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:26,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:28,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:30,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:32,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:35,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:37,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:39,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:43,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:39:45,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:13,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:15,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:17,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:19,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:21,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:23,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:25,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:26,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:28,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:30,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:32,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:34,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:40:36,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:50,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:52,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:54,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:56,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:40:58,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:00,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:02,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:04,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:06,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:08,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:10,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:12,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:14,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:16,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:18,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:20,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:22,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:24,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:26,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:28,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:30,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:32,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:41:34,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:36,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:39,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:41,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:43,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:45,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:47,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:49,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:51,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:53,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:55,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:57,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:41:59,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:01,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:03,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:05,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:08,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:10,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:12,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:14,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:16,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:18,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:42:20,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:22,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:24,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:25,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:50,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:52,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:54,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:56,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:42:58,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:02,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:04,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:06,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:08,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:10,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:12,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:14,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:16,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:18,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:20,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:22,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:24,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:26,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:51,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:43:53,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:44:27,422 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:44:29,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:44:31,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:44:33,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:44:35,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:44:37,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:19,057 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:45:21,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:23,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:25,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:27,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:28,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:28,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse5 .cse4)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse1 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2714))))) (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (or (< (+ (select .cse5 .cse3) 1) v_ArrVal_2714) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| .cse6)))) (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| .cse6)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647))) (forall ((v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2707) .cse4 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse7 .cse4))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_2709) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2714) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store (store .cse7 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| .cse6))))))) (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (v_ArrVal_2714 Int)) (let ((.cse12 (select |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base|)) (.cse13 (+ |c_t2Thread1of1ForFork0_dequeue_~q#1.offset| 1600))) (let ((.cse10 (store |c_#memory_int| |c_t2Thread1of1ForFork0_dequeue_~q#1.base| (store .cse12 .cse13 v_ArrVal_2714)))) (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse10 |c_~#queue~0.base| (store (store (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse11 .cse4))) (< (+ (select .cse12 .cse13) 1) v_ArrVal_2714))))))))) is different from false [2022-12-14 06:45:30,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:30,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (select .cse5 .cse4)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store (store .cse1 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse1 .cse4))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2714))))) (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (or (< (+ (select .cse5 .cse3) 1) v_ArrVal_2714) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store (store .cse5 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| .cse6)))) (forall ((v_ArrVal_2717 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| .cse6)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647))) (forall ((v_ArrVal_2706 Int) (v_ArrVal_2717 Int) (v_ArrVal_2707 Int) (v_ArrVal_2718 Int) (v_ArrVal_2711 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2709 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (v_ArrVal_2720 Int) (v_ArrVal_2712 Int) (v_ArrVal_2714 Int)) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_~#queue~0.offset|) v_ArrVal_2706))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_2707) .cse4 v_ArrVal_2709)) |c_~#stored_elements~0.base| v_ArrVal_2711))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| (select .cse7 .cse4))) (< (+ (select .cse8 .cse4) 1) v_ArrVal_2709) (< (+ (select .cse7 .cse3) 1) v_ArrVal_2714) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store (store .cse7 .cse2 v_ArrVal_2712) .cse3 v_ArrVal_2714) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_242| 4) |c_~#queue~0.offset|) v_ArrVal_2717) .cse2 v_ArrVal_2718) .cse4 v_ArrVal_2720)) |c_~#stored_elements~0.base| v_ArrVal_2722) |c_~#queue~0.base|) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| .cse6)))))))))) is different from false [2022-12-14 06:45:32,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:34,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:36,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:38,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:40,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:43,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 06:45:45,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:47,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:49,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:51,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:53,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:55,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:45:58,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:00,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:02,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:04,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:37,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:39,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:41,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 06:46:43,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]