./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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 05:18:53,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:18:53,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:18:53,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:18:53,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:18:53,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:18:53,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:18:53,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:18:53,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:18:53,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:18:53,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:18:53,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:18:53,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:18:53,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:18:53,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:18:53,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:18:53,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:18:53,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:18:53,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:18:53,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:18:53,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:18:53,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:18:53,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:18:53,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:18:53,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:18:53,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:18:53,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:18:53,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:18:53,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:18:53,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:18:53,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:18:53,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:18:53,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:18:53,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:18:53,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:18:53,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:18:53,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:18:53,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:18:53,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:18:53,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:18:53,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:18:53,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 05:18:53,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:18:53,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:18:53,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:18:53,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:18:53,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:18:53,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:18:53,096 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:18:53,096 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:18:53,097 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:18:53,097 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:18:53,097 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:18:53,097 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:18:53,097 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:18:53,098 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:18:53,098 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:18:53,098 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:18:53,098 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:18:53,098 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:18:53,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:18:53,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:18:53,099 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:18:53,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:18:53,101 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 05:18:53,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:18:53,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:18:53,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:18:53,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:18:53,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:18:53,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:18:53,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:18:53,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:18:53,102 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:18:53,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:18:53,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:18:53,103 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:18:53,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:18:53,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:18:53,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:18:53,104 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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-12-14 05:18:53,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:18:53,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:18:53,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:18:53,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:18:53,335 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:18:53,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-14 05:18:55,816 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:18:56,024 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:18:56,024 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-12-14 05:18:56,038 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/data/72c17597d/4bd4e38d02d545308ade888e0ddb0356/FLAGba8b53c5e [2022-12-14 05:18:56,376 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/data/72c17597d/4bd4e38d02d545308ade888e0ddb0356 [2022-12-14 05:18:56,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:18:56,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:18:56,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:18:56,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:18:56,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:18:56,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f12e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56, skipping insertion in model container [2022-12-14 05:18:56,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:18:56,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:18:56,704 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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-14 05:18:56,706 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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-14 05:18:56,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:18:56,718 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:18:56,749 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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-12-14 05:18:56,751 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_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-12-14 05:18:56,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:18:56,783 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:18:56,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56 WrapperNode [2022-12-14 05:18:56,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:18:56,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:18:56,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:18:56,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:18:56,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,819 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-14 05:18:56,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:18:56,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:18:56,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:18:56,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:18:56,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:18:56,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:18:56,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:18:56,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:18:56,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (1/1) ... [2022-12-14 05:18:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:18:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:56,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:18:56,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:18:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 05:18:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 05:18:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 05:18:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 05:18:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:18:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:18:56,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:18:56,919 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 05:18:57,025 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:18:57,026 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:18:57,294 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:18:57,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:18:57,302 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 05:18:57,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:18:57 BoogieIcfgContainer [2022-12-14 05:18:57,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:18:57,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:18:57,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:18:57,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:18:57,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:18:56" (1/3) ... [2022-12-14 05:18:57,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0aec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:18:57, skipping insertion in model container [2022-12-14 05:18:57,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:18:56" (2/3) ... [2022-12-14 05:18:57,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0aec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:18:57, skipping insertion in model container [2022-12-14 05:18:57,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:18:57" (3/3) ... [2022-12-14 05:18:57,310 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-14 05:18:57,317 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 05:18:57,324 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:18:57,324 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-14 05:18:57,325 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 05:18:57,389 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 05:18:57,414 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 05:18:57,424 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 05:18:57,426 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 05:18:57,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-14 05:18:57,492 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-14 05:18:57,492 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 05:18:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-12-14 05:18:57,502 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-14 05:19:05,408 INFO L134 LiptonReduction]: Checked pairs total: 31164 [2022-12-14 05:19:05,408 INFO L136 LiptonReduction]: Total number of compositions: 241 [2022-12-14 05:19:05,414 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 61 transitions, 138 flow [2022-12-14 05:19:05,459 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 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 05:19:05,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:19:05,476 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;@20a93327, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:19:05,476 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-14 05:19:05,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 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 05:19:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:19:05,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:05,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:05,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash 806788440, now seen corresponding path program 1 times [2022-12-14 05:19:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:05,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372020120] [2022-12-14 05:19:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:06,336 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 05:19:06,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372020120] [2022-12-14 05:19:06,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372020120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:06,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:06,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:19:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874813747] [2022-12-14 05:19:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:06,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:19:06,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:19:06,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:19:06,363 INFO L87 Difference]: Start difference. First operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:06,529 INFO L93 Difference]: Finished difference Result 1068 states and 2836 transitions. [2022-12-14 05:19:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:19:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 05:19:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:06,545 INFO L225 Difference]: With dead ends: 1068 [2022-12-14 05:19:06,545 INFO L226 Difference]: Without dead ends: 1068 [2022-12-14 05:19:06,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:06,548 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:06,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:19:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-12-14 05:19:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1063. [2022-12-14 05:19:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1015 states have (on average 2.7852216748768472) internal successors, (2827), 1062 states have internal predecessors, (2827), 0 states have call successors, (0), 0 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 05:19:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 2827 transitions. [2022-12-14 05:19:06,614 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 2827 transitions. Word has length 7 [2022-12-14 05:19:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:06,614 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 2827 transitions. [2022-12-14 05:19:06,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 2827 transitions. [2022-12-14 05:19:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:19:06,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:06,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:06,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:19:06,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:06,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -280538193, now seen corresponding path program 1 times [2022-12-14 05:19:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257379819] [2022-12-14 05:19:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:06,990 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 05:19:06,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257379819] [2022-12-14 05:19:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257379819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:06,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:06,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749149422] [2022-12-14 05:19:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:06,994 INFO L87 Difference]: Start difference. First operand 1063 states and 2827 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:07,253 INFO L93 Difference]: Finished difference Result 1829 states and 4954 transitions. [2022-12-14 05:19:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:19:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:19:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:07,261 INFO L225 Difference]: With dead ends: 1829 [2022-12-14 05:19:07,261 INFO L226 Difference]: Without dead ends: 1829 [2022-12-14 05:19:07,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:07,262 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:07,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 26 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:19:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-12-14 05:19:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1228. [2022-12-14 05:19:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.828813559322034) internal successors, (3338), 1227 states have internal predecessors, (3338), 0 states have call successors, (0), 0 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 05:19:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3338 transitions. [2022-12-14 05:19:07,297 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3338 transitions. Word has length 8 [2022-12-14 05:19:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:07,297 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3338 transitions. [2022-12-14 05:19:07,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3338 transitions. [2022-12-14 05:19:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:19:07,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:07,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:07,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:19:07,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash -280538192, now seen corresponding path program 1 times [2022-12-14 05:19:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:07,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417145268] [2022-12-14 05:19:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:07,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:07,732 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 05:19:07,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:07,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417145268] [2022-12-14 05:19:07,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417145268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:07,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:07,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019139518] [2022-12-14 05:19:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:07,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:07,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:07,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:07,734 INFO L87 Difference]: Start difference. First operand 1228 states and 3338 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:08,001 INFO L93 Difference]: Finished difference Result 1577 states and 4161 transitions. [2022-12-14 05:19:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:19:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:19:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:08,007 INFO L225 Difference]: With dead ends: 1577 [2022-12-14 05:19:08,007 INFO L226 Difference]: Without dead ends: 1577 [2022-12-14 05:19:08,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:19:08,008 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 95 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:08,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:19:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-12-14 05:19:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1228. [2022-12-14 05:19:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 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 05:19:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 05:19:08,044 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 05:19:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:08,045 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 05:19:08,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 05:19:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:19:08,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:08,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:08,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 05:19:08,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -759260343, now seen corresponding path program 2 times [2022-12-14 05:19:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:08,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809623837] [2022-12-14 05:19:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:08,840 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 05:19:08,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809623837] [2022-12-14 05:19:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809623837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:08,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928007611] [2022-12-14 05:19:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:08,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:08,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:08,842 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:09,483 INFO L93 Difference]: Finished difference Result 1373 states and 3676 transitions. [2022-12-14 05:19:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:19:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:19:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:09,489 INFO L225 Difference]: With dead ends: 1373 [2022-12-14 05:19:09,489 INFO L226 Difference]: Without dead ends: 1373 [2022-12-14 05:19:09,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:19:09,490 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:09,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 29 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:19:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-12-14 05:19:09,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1298. [2022-12-14 05:19:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1250 states have (on average 2.816) internal successors, (3520), 1297 states have internal predecessors, (3520), 0 states have call successors, (0), 0 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 05:19:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 3520 transitions. [2022-12-14 05:19:09,518 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 3520 transitions. Word has length 8 [2022-12-14 05:19:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:09,519 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 3520 transitions. [2022-12-14 05:19:09,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 3520 transitions. [2022-12-14 05:19:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:19:09,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:09,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:09,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:19:09,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -759260342, now seen corresponding path program 2 times [2022-12-14 05:19:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:09,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378229746] [2022-12-14 05:19:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:09,985 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 05:19:09,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:09,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378229746] [2022-12-14 05:19:09,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378229746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:09,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:09,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974669176] [2022-12-14 05:19:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:09,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:09,987 INFO L87 Difference]: Start difference. First operand 1298 states and 3520 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:10,453 INFO L93 Difference]: Finished difference Result 1472 states and 3888 transitions. [2022-12-14 05:19:10,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:19:10,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:19:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:10,458 INFO L225 Difference]: With dead ends: 1472 [2022-12-14 05:19:10,458 INFO L226 Difference]: Without dead ends: 1472 [2022-12-14 05:19:10,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:10,459 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:10,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 26 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:19:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-12-14 05:19:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1228. [2022-12-14 05:19:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 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 05:19:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 05:19:10,484 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 05:19:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:10,484 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 05:19:10,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 05:19:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:19:10,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:10,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:10,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 05:19:10,485 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:10,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:10,486 INFO L85 PathProgramCache]: Analyzing trace with hash -759359853, now seen corresponding path program 3 times [2022-12-14 05:19:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:10,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286447897] [2022-12-14 05:19:10,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:11,069 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 05:19:11,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:11,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286447897] [2022-12-14 05:19:11,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286447897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:11,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:11,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091466443] [2022-12-14 05:19:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:11,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:11,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:11,071 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:11,503 INFO L93 Difference]: Finished difference Result 1373 states and 3676 transitions. [2022-12-14 05:19:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:19:11,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:19:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:11,511 INFO L225 Difference]: With dead ends: 1373 [2022-12-14 05:19:11,511 INFO L226 Difference]: Without dead ends: 1373 [2022-12-14 05:19:11,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:11,512 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:11,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:19:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-12-14 05:19:11,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1228. [2022-12-14 05:19:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 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 05:19:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 05:19:11,546 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 05:19:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:11,546 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 05:19:11,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 05:19:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:19:11,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:11,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:11,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 05:19:11,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1513837204, now seen corresponding path program 1 times [2022-12-14 05:19:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:11,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655926861] [2022-12-14 05:19:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:11,585 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 05:19:11,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655926861] [2022-12-14 05:19:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655926861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:11,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:11,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:19:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789905826] [2022-12-14 05:19:11,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:19:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:19:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:19:11,587 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:11,697 INFO L93 Difference]: Finished difference Result 1990 states and 5370 transitions. [2022-12-14 05:19:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:19:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:19:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:11,703 INFO L225 Difference]: With dead ends: 1990 [2022-12-14 05:19:11,703 INFO L226 Difference]: Without dead ends: 1990 [2022-12-14 05:19:11,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:19:11,703 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:11,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 20 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:19:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-12-14 05:19:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1802. [2022-12-14 05:19:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1754 states have (on average 2.8916761687571264) internal successors, (5072), 1801 states have internal predecessors, (5072), 0 states have call successors, (0), 0 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 05:19:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 5072 transitions. [2022-12-14 05:19:11,733 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 5072 transitions. Word has length 9 [2022-12-14 05:19:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:11,734 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 5072 transitions. [2022-12-14 05:19:11,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 5072 transitions. [2022-12-14 05:19:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:19:11,735 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:11,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:11,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 05:19:11,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:11,735 INFO L85 PathProgramCache]: Analyzing trace with hash 393815127, now seen corresponding path program 1 times [2022-12-14 05:19:11,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:11,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393985191] [2022-12-14 05:19:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:11,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:11,942 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 05:19:11,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:11,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393985191] [2022-12-14 05:19:11,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393985191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:11,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:11,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:19:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154159911] [2022-12-14 05:19:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:11,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:19:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:11,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:19:11,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:19:11,944 INFO L87 Difference]: Start difference. First operand 1802 states and 5072 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:12,119 INFO L93 Difference]: Finished difference Result 2029 states and 5760 transitions. [2022-12-14 05:19:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:19:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 05:19:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:12,128 INFO L225 Difference]: With dead ends: 2029 [2022-12-14 05:19:12,128 INFO L226 Difference]: Without dead ends: 2029 [2022-12-14 05:19:12,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:12,129 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:12,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 29 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:19:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-12-14 05:19:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1805. [2022-12-14 05:19:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1757 states have (on average 2.890153671030165) internal successors, (5078), 1804 states have internal predecessors, (5078), 0 states have call successors, (0), 0 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 05:19:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 5078 transitions. [2022-12-14 05:19:12,164 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 5078 transitions. Word has length 10 [2022-12-14 05:19:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:12,165 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 5078 transitions. [2022-12-14 05:19:12,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 5078 transitions. [2022-12-14 05:19:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:19:12,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:12,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 05:19:12,166 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:12,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 489437856, now seen corresponding path program 1 times [2022-12-14 05:19:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:12,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075589761] [2022-12-14 05:19:12,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:12,403 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 05:19:12,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:12,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075589761] [2022-12-14 05:19:12,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075589761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:12,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:12,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:19:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718063015] [2022-12-14 05:19:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:19:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:19:12,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:12,404 INFO L87 Difference]: Start difference. First operand 1805 states and 5078 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:12,615 INFO L93 Difference]: Finished difference Result 2527 states and 7039 transitions. [2022-12-14 05:19:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:19:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:19:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:12,625 INFO L225 Difference]: With dead ends: 2527 [2022-12-14 05:19:12,625 INFO L226 Difference]: Without dead ends: 2527 [2022-12-14 05:19:12,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:19:12,626 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:12,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 29 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:19:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2022-12-14 05:19:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2050. [2022-12-14 05:19:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2002 states have (on average 2.866133866133866) internal successors, (5738), 2049 states have internal predecessors, (5738), 0 states have call successors, (0), 0 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 05:19:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 5738 transitions. [2022-12-14 05:19:12,662 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 5738 transitions. Word has length 11 [2022-12-14 05:19:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:12,662 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 5738 transitions. [2022-12-14 05:19:12,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 5738 transitions. [2022-12-14 05:19:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:19:12,663 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:12,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:12,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 05:19:12,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1196506376, now seen corresponding path program 1 times [2022-12-14 05:19:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:12,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555806540] [2022-12-14 05:19:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:12,694 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 05:19:12,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:12,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555806540] [2022-12-14 05:19:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555806540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:19:12,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562549741] [2022-12-14 05:19:12,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:12,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:19:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:19:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:19:12,695 INFO L87 Difference]: Start difference. First operand 2050 states and 5738 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:12,748 INFO L93 Difference]: Finished difference Result 590 states and 1369 transitions. [2022-12-14 05:19:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:19:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:19:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:12,750 INFO L225 Difference]: With dead ends: 590 [2022-12-14 05:19:12,750 INFO L226 Difference]: Without dead ends: 568 [2022-12-14 05:19:12,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:19:12,751 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:12,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:19:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-12-14 05:19:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-12-14 05:19:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 550 states have (on average 2.4127272727272726) internal successors, (1327), 567 states have internal predecessors, (1327), 0 states have call successors, (0), 0 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 05:19:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1327 transitions. [2022-12-14 05:19:12,758 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1327 transitions. Word has length 11 [2022-12-14 05:19:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:12,759 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 1327 transitions. [2022-12-14 05:19:12,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1327 transitions. [2022-12-14 05:19:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:19:12,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:12,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:12,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 05:19:12,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1830710074, now seen corresponding path program 2 times [2022-12-14 05:19:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:12,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719418609] [2022-12-14 05:19:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:13,084 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 05:19:13,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:13,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719418609] [2022-12-14 05:19:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719418609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:13,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:19:13,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032931151] [2022-12-14 05:19:13,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:13,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:19:13,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:13,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:19:13,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:19:13,086 INFO L87 Difference]: Start difference. First operand 568 states and 1327 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:13,225 INFO L93 Difference]: Finished difference Result 797 states and 1874 transitions. [2022-12-14 05:19:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:19:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:19:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:13,228 INFO L225 Difference]: With dead ends: 797 [2022-12-14 05:19:13,228 INFO L226 Difference]: Without dead ends: 797 [2022-12-14 05:19:13,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 05:19:13,229 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:13,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 16 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:19:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-12-14 05:19:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 546. [2022-12-14 05:19:13,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 528 states have (on average 2.418560606060606) internal successors, (1277), 545 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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 05:19:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1277 transitions. [2022-12-14 05:19:13,242 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1277 transitions. Word has length 11 [2022-12-14 05:19:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:13,242 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 1277 transitions. [2022-12-14 05:19:13,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1277 transitions. [2022-12-14 05:19:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 05:19:13,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:13,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:13,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 05:19:13,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash 499134818, now seen corresponding path program 1 times [2022-12-14 05:19:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:13,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519574248] [2022-12-14 05:19:13,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:13,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:13,282 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 05:19:13,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:13,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519574248] [2022-12-14 05:19:13,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519574248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:19:13,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:19:13,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:19:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319733700] [2022-12-14 05:19:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:19:13,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:19:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:19:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:19:13,284 INFO L87 Difference]: Start difference. First operand 546 states and 1277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:19:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:13,345 INFO L93 Difference]: Finished difference Result 570 states and 1325 transitions. [2022-12-14 05:19:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:19:13,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 05:19:13,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:13,347 INFO L225 Difference]: With dead ends: 570 [2022-12-14 05:19:13,348 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 05:19:13,348 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 05:19:13,348 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:13,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:19:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 05:19:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2022-12-14 05:19:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.4003623188405796) internal successors, (1325), 569 states have internal predecessors, (1325), 0 states have call successors, (0), 0 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 05:19:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1325 transitions. [2022-12-14 05:19:13,355 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1325 transitions. Word has length 12 [2022-12-14 05:19:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:13,355 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1325 transitions. [2022-12-14 05:19:13,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 05:19:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1325 transitions. [2022-12-14 05:19:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:19:13,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:13,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:13,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 05:19:13,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:13,356 INFO L85 PathProgramCache]: Analyzing trace with hash 551037305, now seen corresponding path program 1 times [2022-12-14 05:19:13,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:13,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741748787] [2022-12-14 05:19:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:13,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:13,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741748787] [2022-12-14 05:19:13,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741748787] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:13,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685368074] [2022-12-14 05:19:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:13,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:13,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:13,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:19:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:13,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 05:19:13,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:13,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:13,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:13,796 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:19:13,796 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 05:19:13,807 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:19:13,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 05:19:13,906 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 05:19:13,979 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 05:19:14,130 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 05:19:14,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:14,203 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 05:19:14,339 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 05:19:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:14,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:14,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_470 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_468) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_470) (+ 3208 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-14 05:19:14,561 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_468 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_470 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_466)) |c_~#stored_elements~0.base| v_ArrVal_468) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_470) (+ 3208 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_466 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-12-14 05:19:14,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_468 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_470 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_466)) |c_~#stored_elements~0.base| v_ArrVal_468) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_466) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_470) (+ 3208 |c_~#queue~0.offset|)))))))) is different from false [2022-12-14 05:19:14,647 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_464 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_470 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_464) .cse1 v_ArrVal_466)) |c_~#stored_elements~0.base| v_ArrVal_468) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_464 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_466) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_470) (+ 3208 |c_~#queue~0.offset|)) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 05:19:14,702 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_468 (Array Int Int)) (v_ArrVal_464 Int) (v_ArrVal_462 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_470 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_462)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_464) .cse2 v_ArrVal_466)) |c_~#stored_elements~0.base| v_ArrVal_468) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ v_ArrVal_464 2147483648) 0) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_470) (+ 3208 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_466))))) is different from false [2022-12-14 05:19:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 05:19:14,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685368074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:14,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798454967] [2022-12-14 05:19:14,852 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 05:19:14,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:14,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-12-14 05:19:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9765591] [2022-12-14 05:19:14,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:14,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:19:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:19:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=346, Unknown=5, NotChecked=220, Total=702 [2022-12-14 05:19:14,855 INFO L87 Difference]: Start difference. First operand 570 states and 1325 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:17,537 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 05:19:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:45,886 INFO L93 Difference]: Finished difference Result 1792 states and 4169 transitions. [2022-12-14 05:19:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 05:19:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:19:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:45,890 INFO L225 Difference]: With dead ends: 1792 [2022-12-14 05:19:45,890 INFO L226 Difference]: Without dead ends: 1792 [2022-12-14 05:19:45,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=501, Invalid=1320, Unknown=5, NotChecked=430, Total=2256 [2022-12-14 05:19:45,891 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 361 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 627 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:45,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 138 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1169 Invalid, 1 Unknown, 627 Unchecked, 4.3s Time] [2022-12-14 05:19:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2022-12-14 05:19:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 834. [2022-12-14 05:19:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 816 states have (on average 2.5857843137254903) internal successors, (2110), 833 states have internal predecessors, (2110), 0 states have call successors, (0), 0 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 05:19:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2110 transitions. [2022-12-14 05:19:45,909 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 2110 transitions. Word has length 15 [2022-12-14 05:19:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:45,909 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 2110 transitions. [2022-12-14 05:19:45,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 2110 transitions. [2022-12-14 05:19:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:19:45,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:45,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:45,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:19:46,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 05:19:46,111 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:19:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash 551037306, now seen corresponding path program 1 times [2022-12-14 05:19:46,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:46,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757013754] [2022-12-14 05:19:46,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:46,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:46,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:46,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757013754] [2022-12-14 05:19:46,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757013754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:46,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838805304] [2022-12-14 05:19:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:46,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:46,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:46,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:19:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:46,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 05:19:46,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:46,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:46,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:46,861 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:19:46,861 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 05:19:46,871 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:19:46,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 05:19:46,939 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 05:19:47,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:19:47,170 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 05:19:47,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:47,234 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 05:19:47,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 63 treesize of output 56 [2022-12-14 05:19:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:47,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:47,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_562 Int) (v_ArrVal_564 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_562)) |c_~#stored_elements~0.base| v_ArrVal_564) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_562 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_565) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 05:19:47,639 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_562 Int) (v_ArrVal_564 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_562)) |c_~#stored_elements~0.base| v_ArrVal_564) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_565) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_562))))) is different from false [2022-12-14 05:19:47,671 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_562 Int) (v_ArrVal_561 Int) (v_ArrVal_564 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_561) .cse2 v_ArrVal_562)) |c_~#stored_elements~0.base| v_ArrVal_564) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_562) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_565) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_561 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-14 05:19:50,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_562 Int) (v_ArrVal_561 Int) (v_ArrVal_559 Int) (v_ArrVal_564 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_559)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_561) .cse3 v_ArrVal_562)) |c_~#stored_elements~0.base| v_ArrVal_564) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_565) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_561) (< (+ (select .cse1 .cse3) 1) v_ArrVal_562) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 05:19:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:19:56,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838805304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:56,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817367548] [2022-12-14 05:19:56,421 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 05:19:56,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:56,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-14 05:19:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187100236] [2022-12-14 05:19:56,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:56,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 05:19:56,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 05:19:56,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=588, Unknown=14, NotChecked=228, Total=1056 [2022-12-14 05:19:56,423 INFO L87 Difference]: Start difference. First operand 834 states and 2110 transitions. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:19:59,973 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 05:20:01,984 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 05:20:04,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:20:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:04,641 INFO L93 Difference]: Finished difference Result 850 states and 2142 transitions. [2022-12-14 05:20:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:20:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:20:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:04,643 INFO L225 Difference]: With dead ends: 850 [2022-12-14 05:20:04,643 INFO L226 Difference]: Without dead ends: 850 [2022-12-14 05:20:04,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=461, Invalid=1181, Unknown=14, NotChecked=324, Total=1980 [2022-12-14 05:20:04,644 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 10 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:04,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 99 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 793 Invalid, 15 Unknown, 308 Unchecked, 7.1s Time] [2022-12-14 05:20:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-12-14 05:20:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 840. [2022-12-14 05:20:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 822 states have (on average 2.5851581508515813) internal successors, (2125), 839 states have internal predecessors, (2125), 0 states have call successors, (0), 0 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 05:20:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2125 transitions. [2022-12-14 05:20:04,654 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2125 transitions. Word has length 15 [2022-12-14 05:20:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:04,654 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 2125 transitions. [2022-12-14 05:20:04,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2125 transitions. [2022-12-14 05:20:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:20:04,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:04,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:04,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 05:20:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:04,856 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:20:04,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:04,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1170958127, now seen corresponding path program 1 times [2022-12-14 05:20:04,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:04,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923016887] [2022-12-14 05:20:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:05,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:05,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923016887] [2022-12-14 05:20:05,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923016887] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:05,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205512545] [2022-12-14 05:20:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:05,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:05,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:05,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:05,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:20:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:05,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 05:20:05,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:05,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:05,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:05,613 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:20:05,613 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 05:20:05,628 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:20:05,629 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 05:20:05,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:20:05,732 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 05:20:05,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:20:05,986 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 05:20:06,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:06,054 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 05:20:06,195 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 05:20:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:06,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:06,449 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_667 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int) (v_ArrVal_668 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_665)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_668) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_665 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-12-14 05:20:06,857 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int) (v_ArrVal_668 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_664) .cse2 v_ArrVal_665)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_668) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_665) (not (<= v_ArrVal_664 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-12-14 05:20:19,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| Int) (v_ArrVal_662 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_668 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_660))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| 4) |c_~#queue~0.offset|) v_ArrVal_662)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_664) .cse2 v_ArrVal_665)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_668) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| (select .cse0 .cse2))) (< (+ (select .cse3 .cse2) 1) v_ArrVal_665) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_100| (select .cse4 .cse2))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_664))))))) is different from false [2022-12-14 05:20:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205512545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648256486] [2022-12-14 05:20:19,526 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 05:20:19,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-12-14 05:20:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870409078] [2022-12-14 05:20:19,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:20:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:20:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=764, Unknown=32, NotChecked=192, Total=1260 [2022-12-14 05:20:19,529 INFO L87 Difference]: Start difference. First operand 840 states and 2125 transitions. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:23,210 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 05:20:25,216 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 05:20:25,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_665 Int) (v_ArrVal_667 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int) (v_ArrVal_668 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_665)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_668) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_665)))) (forall ((v_ArrVal_665 Int) (v_ArrVal_667 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| Int) (v_ArrVal_668 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_665)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| (select .cse5 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_99| 4)) v_ArrVal_668) .cse2) 2147483647) (not (<= v_ArrVal_665 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))))) is different from false [2022-12-14 05:20:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:27,357 INFO L93 Difference]: Finished difference Result 1350 states and 3343 transitions. [2022-12-14 05:20:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:20:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:20:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:27,360 INFO L225 Difference]: With dead ends: 1350 [2022-12-14 05:20:27,361 INFO L226 Difference]: Without dead ends: 1350 [2022-12-14 05:20:27,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=460, Invalid=1245, Unknown=33, NotChecked=332, Total=2070 [2022-12-14 05:20:27,361 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 443 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 22 mSolverCounterUnsat, 101 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 101 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:27,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 175 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1334 Invalid, 101 Unknown, 605 Unchecked, 6.9s Time] [2022-12-14 05:20:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-12-14 05:20:27,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 961. [2022-12-14 05:20:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 943 states have (on average 2.6139978791092258) internal successors, (2465), 960 states have internal predecessors, (2465), 0 states have call successors, (0), 0 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 05:20:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2465 transitions. [2022-12-14 05:20:27,375 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 2465 transitions. Word has length 16 [2022-12-14 05:20:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:27,375 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 2465 transitions. [2022-12-14 05:20:27,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:27,375 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 2465 transitions. [2022-12-14 05:20:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:20:27,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:27,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:27,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:20:27,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:20:27,577 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:20:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019792, now seen corresponding path program 1 times [2022-12-14 05:20:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:27,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140697022] [2022-12-14 05:20:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:27,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140697022] [2022-12-14 05:20:27,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140697022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:27,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555652567] [2022-12-14 05:20:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:27,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:27,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:20:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:28,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 05:20:28,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:28,029 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 05:20:28,029 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 05:20:28,121 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 05:20:28,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:28,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:20:28,214 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 05:20:28,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:28,234 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 05:20:28,280 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 05:20:28,280 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 05:20:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:28,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:28,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_757 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_755) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_757) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_757 2147483648) 0))) is different from false [2022-12-14 05:20:28,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:28,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-12-14 05:20:28,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:28,586 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 1329 treesize of output 1315 [2022-12-14 05:20:28,599 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 1586 treesize of output 1490 [2022-12-14 05:20:28,613 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 1922 treesize of output 1866 [2022-12-14 05:20:28,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:28,803 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 701 treesize of output 689 [2022-12-14 05:20:29,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:29,086 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 1707 treesize of output 1683 [2022-12-14 05:20:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:30,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555652567] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063883740] [2022-12-14 05:20:30,887 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 05:20:30,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:30,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 05:20:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978371246] [2022-12-14 05:20:30,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:30,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 05:20:30,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 05:20:30,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=480, Unknown=12, NotChecked=46, Total=650 [2022-12-14 05:20:30,890 INFO L87 Difference]: Start difference. First operand 961 states and 2465 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:31,257 INFO L93 Difference]: Finished difference Result 1046 states and 2641 transitions. [2022-12-14 05:20:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:20:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:20:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:31,260 INFO L225 Difference]: With dead ends: 1046 [2022-12-14 05:20:31,260 INFO L226 Difference]: Without dead ends: 1046 [2022-12-14 05:20:31,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=591, Unknown=12, NotChecked=52, Total=812 [2022-12-14 05:20:31,261 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 640 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:31,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 27 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 297 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2022-12-14 05:20:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-12-14 05:20:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 818. [2022-12-14 05:20:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 802 states have (on average 2.518703241895262) internal successors, (2020), 817 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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 05:20:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2020 transitions. [2022-12-14 05:20:31,277 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2020 transitions. Word has length 16 [2022-12-14 05:20:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:31,277 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2020 transitions. [2022-12-14 05:20:31,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2020 transitions. [2022-12-14 05:20:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:20:31,278 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:31,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:31,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:20:31,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:20:31,480 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:20:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019791, now seen corresponding path program 2 times [2022-12-14 05:20:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:31,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227348430] [2022-12-14 05:20:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:32,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:32,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227348430] [2022-12-14 05:20:32,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227348430] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:32,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140849104] [2022-12-14 05:20:32,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:20:32,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:32,157 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:32,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:20:32,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:20:32,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 05:20:32,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:32,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:32,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:32,315 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:20:32,316 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 05:20:32,331 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:20:32,332 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 05:20:32,443 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 05:20:32,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:20:32,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 05:20:32,797 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 05:20:32,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:32,865 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 05:20:33,010 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 05:20:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:33,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:33,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 05:20:33,340 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-14 05:20:33,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-14 05:20:33,392 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_854 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-14 05:20:33,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_854) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))))) is different from false [2022-12-14 05:20:33,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_852)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_856))))))) is different from false [2022-12-14 05:20:33,484 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_852)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_854)))))))) is different from false [2022-12-14 05:20:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 05:20:33,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140849104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1148360484] [2022-12-14 05:20:33,555 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 05:20:33,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:33,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 05:20:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161900774] [2022-12-14 05:20:33,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:33,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:20:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:33,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:20:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=580, Unknown=8, NotChecked=406, Total=1190 [2022-12-14 05:20:33,557 INFO L87 Difference]: Start difference. First operand 818 states and 2020 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:41,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:41,025 INFO L93 Difference]: Finished difference Result 1152 states and 2788 transitions. [2022-12-14 05:20:41,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 05:20:41,026 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:20:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:41,028 INFO L225 Difference]: With dead ends: 1152 [2022-12-14 05:20:41,028 INFO L226 Difference]: Without dead ends: 1152 [2022-12-14 05:20:41,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=641, Invalid=1813, Unknown=24, NotChecked=714, Total=3192 [2022-12-14 05:20:41,029 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 511 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 32 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:41,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 121 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 952 Invalid, 25 Unknown, 891 Unchecked, 1.3s Time] [2022-12-14 05:20:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-12-14 05:20:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 829. [2022-12-14 05:20:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 813 states have (on average 2.5153751537515374) internal successors, (2045), 828 states have internal predecessors, (2045), 0 states have call successors, (0), 0 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 05:20:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2045 transitions. [2022-12-14 05:20:41,043 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2045 transitions. Word has length 16 [2022-12-14 05:20:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:41,043 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 2045 transitions. [2022-12-14 05:20:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:20:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2045 transitions. [2022-12-14 05:20:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:20:41,044 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:41,044 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:41,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 05:20:41,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:41,245 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:20:41,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash -99715525, now seen corresponding path program 3 times [2022-12-14 05:20:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982211334] [2022-12-14 05:20:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:42,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982211334] [2022-12-14 05:20:42,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982211334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:42,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755708812] [2022-12-14 05:20:42,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:20:42,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:42,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:42,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:20:42,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:20:42,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:42,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 05:20:42,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:42,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:42,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:42,318 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:20:42,318 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 05:20:42,336 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:20:42,336 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 05:20:42,447 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 05:20:42,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:20:42,729 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 05:20:42,799 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 05:20:42,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:42,865 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 05:20:43,004 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 05:20:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:43,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:43,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-14 05:20:43,238 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-14 05:21:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:01,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755708812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:21:01,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572334940] [2022-12-14 05:21:01,119 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 05:21:01,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:21:01,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 05:21:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867921056] [2022-12-14 05:21:01,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:21:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:21:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:21:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:21:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=814, Unknown=33, NotChecked=126, Total=1190 [2022-12-14 05:21:01,120 INFO L87 Difference]: Start difference. First operand 829 states and 2045 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:21:04,431 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 05:21:19,739 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:21:31,469 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 160 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:21:36,452 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 05:21:38,500 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 05:21:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:21:43,616 INFO L93 Difference]: Finished difference Result 1904 states and 4556 transitions. [2022-12-14 05:21:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:21:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:21:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:21:43,619 INFO L225 Difference]: With dead ends: 1904 [2022-12-14 05:21:43,619 INFO L226 Difference]: Without dead ends: 1904 [2022-12-14 05:21:43,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=765, Invalid=2473, Unknown=76, NotChecked=226, Total=3540 [2022-12-14 05:21:43,620 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 647 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 68 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:21:43,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 162 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1343 Invalid, 124 Unknown, 324 Unchecked, 11.8s Time] [2022-12-14 05:21:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2022-12-14 05:21:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 818. [2022-12-14 05:21:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 802 states have (on average 2.518703241895262) internal successors, (2020), 817 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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 05:21:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2020 transitions. [2022-12-14 05:21:43,634 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2020 transitions. Word has length 16 [2022-12-14 05:21:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:21:43,634 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2020 transitions. [2022-12-14 05:21:43,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:21:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2020 transitions. [2022-12-14 05:21:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:21:43,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:21:43,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:21:43,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:21:43,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 05:21:43,836 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:21:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:21:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash -97710445, now seen corresponding path program 4 times [2022-12-14 05:21:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:21:43,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805988831] [2022-12-14 05:21:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:21:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:21:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:44,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:21:44,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805988831] [2022-12-14 05:21:44,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805988831] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:21:44,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327720200] [2022-12-14 05:21:44,873 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:21:44,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:44,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:21:44,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:21:44,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:21:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:44,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 05:21:44,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:21:44,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:44,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:44,987 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:21:44,987 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 05:21:45,002 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:21:45,002 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 05:21:45,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 05:21:45,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:21:45,393 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 05:21:45,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:45,469 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 05:21:45,644 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 05:21:45,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 52 treesize of output 54 [2022-12-14 05:21:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:45,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:21:45,951 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1066 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-12-14 05:21:46,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-14 05:21:46,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse1 (+ |c_~#queue~0.offset| 3204)))) (not (<= v_ArrVal_1061 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))) is different from false [2022-12-14 05:21:46,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1061) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse3 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-14 05:21:46,161 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (v_ArrVal_1059 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1059) .cse3 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1061) (not (<= v_ArrVal_1059 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse1 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-14 05:21:46,320 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (v_ArrVal_1057 Int) (v_ArrVal_1059 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1057)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1059) .cse3 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1059) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1061) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-14 05:21:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:21:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327720200] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:21:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1576051583] [2022-12-14 05:21:50,526 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 05:21:50,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:21:50,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-12-14 05:21:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152071898] [2022-12-14 05:21:50,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:21:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:21:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:21:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:21:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=655, Unknown=18, NotChecked=366, Total=1260 [2022-12-14 05:21:50,529 INFO L87 Difference]: Start difference. First operand 818 states and 2020 transitions. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:05,681 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 145 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:22:17,206 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 05:22:23,779 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 154 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:22:25,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 [0, 1] [2022-12-14 05:22:26,631 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (forall ((v_ArrVal_1065 Int) (v_ArrVal_1066 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647))) is different from false [2022-12-14 05:22:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:27,243 INFO L93 Difference]: Finished difference Result 1759 states and 4309 transitions. [2022-12-14 05:22:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:22:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:22:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:27,248 INFO L225 Difference]: With dead ends: 1759 [2022-12-14 05:22:27,248 INFO L226 Difference]: Without dead ends: 1759 [2022-12-14 05:22:27,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=688, Invalid=1766, Unknown=24, NotChecked=714, Total=3192 [2022-12-14 05:22:27,250 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 691 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 60 mSolverCounterUnsat, 60 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 60 IncrementalHoareTripleChecker+Unknown, 1260 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:27,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 146 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1030 Invalid, 60 Unknown, 1260 Unchecked, 7.0s Time] [2022-12-14 05:22:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-12-14 05:22:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 818. [2022-12-14 05:22:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 802 states have (on average 2.518703241895262) internal successors, (2020), 817 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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 05:22:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2020 transitions. [2022-12-14 05:22:27,270 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2020 transitions. Word has length 16 [2022-12-14 05:22:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:27,270 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2020 transitions. [2022-12-14 05:22:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2020 transitions. [2022-12-14 05:22:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:22:27,270 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:27,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:27,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:22:27,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:27,472 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 583735446, now seen corresponding path program 1 times [2022-12-14 05:22:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:27,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545970765] [2022-12-14 05:22:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:27,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545970765] [2022-12-14 05:22:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545970765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28866262] [2022-12-14 05:22:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:27,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:27,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:27,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:27,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:22:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:27,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 05:22:27,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:27,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:22:27,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:27,983 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 05:22:28,042 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 05:22:28,042 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 05:22:28,091 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 25 treesize of output 24 [2022-12-14 05:22:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:28,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:28,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:28,255 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 05:22:28,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:28,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-12-14 05:22:28,268 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 05:22:28,284 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 05:22:28,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:28,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-12-14 05:22:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:28,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28866262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:28,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2061374293] [2022-12-14 05:22:28,390 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 05:22:28,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:28,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-14 05:22:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463054457] [2022-12-14 05:22:28,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:28,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 05:22:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 05:22:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=350, Unknown=1, NotChecked=0, Total=420 [2022-12-14 05:22:28,392 INFO L87 Difference]: Start difference. First operand 818 states and 2020 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:28,918 INFO L93 Difference]: Finished difference Result 1439 states and 3465 transitions. [2022-12-14 05:22:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:22:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 05:22:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:28,921 INFO L225 Difference]: With dead ends: 1439 [2022-12-14 05:22:28,921 INFO L226 Difference]: Without dead ends: 1439 [2022-12-14 05:22:28,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=508, Unknown=1, NotChecked=0, Total=650 [2022-12-14 05:22:28,922 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 446 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:28,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 51 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:22:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-12-14 05:22:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 938. [2022-12-14 05:22:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 922 states have (on average 2.531453362255965) internal successors, (2334), 937 states have internal predecessors, (2334), 0 states have call successors, (0), 0 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 05:22:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 2334 transitions. [2022-12-14 05:22:28,935 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 2334 transitions. Word has length 18 [2022-12-14 05:22:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:28,936 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 2334 transitions. [2022-12-14 05:22:28,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 2334 transitions. [2022-12-14 05:22:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:22:28,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:28,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:28,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:22:29,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:29,137 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -292825616, now seen corresponding path program 1 times [2022-12-14 05:22:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403483291] [2022-12-14 05:22:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:29,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:29,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403483291] [2022-12-14 05:22:29,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403483291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:29,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970447218] [2022-12-14 05:22:29,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:29,691 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:29,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:22:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:29,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-14 05:22:29,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:29,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:29,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:29,845 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:22:29,845 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 05:22:29,865 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:22:29,865 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 05:22:29,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:22:29,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-12-14 05:22:30,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-12-14 05:22:30,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-12-14 05:22:30,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:30,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-12-14 05:22:30,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-12-14 05:22:30,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-12-14 05:22:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:30,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:30,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1256) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1257)) .cse1)) 2147483647)) is different from false [2022-12-14 05:22:30,563 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1256) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1257)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-12-14 05:22:30,576 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1253 Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1253) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1256) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1257)) .cse1)) 2147483647)) (= .cse4 800)))) is different from false [2022-12-14 05:22:30,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1250)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1253) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1256) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1257)) .cse2)) 2147483647))))) is different from false [2022-12-14 05:22:30,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1250 Int) (v_ArrVal_1253 Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1249))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1250)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 800) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1253) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1256) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1257)) .cse2) 2147483647)))))) is different from false [2022-12-14 05:22:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 05:22:30,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970447218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:30,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1042579867] [2022-12-14 05:22:30,730 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 05:22:30,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:30,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-12-14 05:22:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120093245] [2022-12-14 05:22:30,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:30,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 05:22:30,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 05:22:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=579, Unknown=13, NotChecked=280, Total=1056 [2022-12-14 05:22:30,732 INFO L87 Difference]: Start difference. First operand 938 states and 2334 transitions. Second operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:33,997 INFO L93 Difference]: Finished difference Result 1907 states and 4550 transitions. [2022-12-14 05:22:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 05:22:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:22:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:34,000 INFO L225 Difference]: With dead ends: 1907 [2022-12-14 05:22:34,001 INFO L226 Difference]: Without dead ends: 1907 [2022-12-14 05:22:34,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 15 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=467, Invalid=1608, Unknown=15, NotChecked=460, Total=2550 [2022-12-14 05:22:34,001 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 337 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 40 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 840 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:34,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 138 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1264 Invalid, 34 Unknown, 840 Unchecked, 1.9s Time] [2022-12-14 05:22:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2022-12-14 05:22:34,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1042. [2022-12-14 05:22:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1026 states have (on average 2.517543859649123) internal successors, (2583), 1041 states have internal predecessors, (2583), 0 states have call successors, (0), 0 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 05:22:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 2583 transitions. [2022-12-14 05:22:34,017 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 2583 transitions. Word has length 19 [2022-12-14 05:22:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:34,017 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 2583 transitions. [2022-12-14 05:22:34,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 2583 transitions. [2022-12-14 05:22:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:22:34,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:34,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:34,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:22:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:34,219 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1488521269, now seen corresponding path program 1 times [2022-12-14 05:22:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:34,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441184713] [2022-12-14 05:22:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:34,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:34,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441184713] [2022-12-14 05:22:34,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441184713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:34,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811656806] [2022-12-14 05:22:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:34,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:34,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:34,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:34,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:22:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:34,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 05:22:34,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:34,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:34,739 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:22:34,739 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 05:22:34,754 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:22:34,755 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 05:22:34,854 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 05:22:34,917 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 05:22:35,047 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 05:22:35,114 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 05:22:35,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:35,178 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 05:22:35,301 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 05:22:35,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 05:22:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:35,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:35,684 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1367 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1365) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_1367) .cse1)))))) is different from false [2022-12-14 05:22:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811656806] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758087223] [2022-12-14 05:22:36,335 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 05:22:36,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-12-14 05:22:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476686838] [2022-12-14 05:22:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:36,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 05:22:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 05:22:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=624, Unknown=14, NotChecked=54, Total=870 [2022-12-14 05:22:36,336 INFO L87 Difference]: Start difference. First operand 1042 states and 2583 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:49,878 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 05:22:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:49,923 INFO L93 Difference]: Finished difference Result 1777 states and 4351 transitions. [2022-12-14 05:22:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 05:22:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:22:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:49,925 INFO L225 Difference]: With dead ends: 1777 [2022-12-14 05:22:49,925 INFO L226 Difference]: Without dead ends: 1777 [2022-12-14 05:22:49,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 5 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=718, Invalid=1713, Unknown=23, NotChecked=96, Total=2550 [2022-12-14 05:22:49,926 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 995 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 108 mSolverCounterUnsat, 210 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 210 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:49,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 141 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 983 Invalid, 210 Unknown, 141 Unchecked, 4.8s Time] [2022-12-14 05:22:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-12-14 05:22:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 987. [2022-12-14 05:22:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 973 states have (on average 2.4645426515930113) internal successors, (2398), 986 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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 05:22:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2398 transitions. [2022-12-14 05:22:49,939 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2398 transitions. Word has length 19 [2022-12-14 05:22:49,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:49,939 INFO L495 AbstractCegarLoop]: Abstraction has 987 states and 2398 transitions. [2022-12-14 05:22:49,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2398 transitions. [2022-12-14 05:22:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:22:49,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:49,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:49,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:22:50,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 05:22:50,141 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:50,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032351, now seen corresponding path program 1 times [2022-12-14 05:22:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:50,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600606022] [2022-12-14 05:22:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:50,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:50,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600606022] [2022-12-14 05:22:50,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600606022] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:50,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673994772] [2022-12-14 05:22:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:50,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:50,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:50,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:22:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:22:50,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:50,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:22:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673994772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:22:50,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:22:50,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-14 05:22:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368522002] [2022-12-14 05:22:50,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:22:50,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:22:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:50,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:22:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:22:50,294 INFO L87 Difference]: Start difference. First operand 987 states and 2398 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 05:22:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:50,361 INFO L93 Difference]: Finished difference Result 975 states and 2338 transitions. [2022-12-14 05:22:50,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:22:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 05:22:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:50,362 INFO L225 Difference]: With dead ends: 975 [2022-12-14 05:22:50,362 INFO L226 Difference]: Without dead ends: 975 [2022-12-14 05:22:50,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:22:50,363 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:50,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 8 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:22:50,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2022-12-14 05:22:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2022-12-14 05:22:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 963 states have (on average 2.427829698857736) internal successors, (2338), 974 states have internal predecessors, (2338), 0 states have call successors, (0), 0 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 05:22:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 2338 transitions. [2022-12-14 05:22:50,375 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 2338 transitions. Word has length 20 [2022-12-14 05:22:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:50,375 INFO L495 AbstractCegarLoop]: Abstraction has 975 states and 2338 transitions. [2022-12-14 05:22:50,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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 05:22:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 2338 transitions. [2022-12-14 05:22:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:22:50,376 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:50,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:50,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 05:22:50,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 05:22:50,577 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032350, now seen corresponding path program 1 times [2022-12-14 05:22:50,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:50,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578575755] [2022-12-14 05:22:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:22:50,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:50,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578575755] [2022-12-14 05:22:50,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578575755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:22:50,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:22:50,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:22:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603244760] [2022-12-14 05:22:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:22:50,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:22:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:22:50,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:22:50,645 INFO L87 Difference]: Start difference. First operand 975 states and 2338 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 05:22:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:50,704 INFO L93 Difference]: Finished difference Result 963 states and 2278 transitions. [2022-12-14 05:22:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:22:50,705 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 05:22:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:50,706 INFO L225 Difference]: With dead ends: 963 [2022-12-14 05:22:50,706 INFO L226 Difference]: Without dead ends: 963 [2022-12-14 05:22:50,706 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 05:22:50,706 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:22:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-12-14 05:22:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-12-14 05:22:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 953 states have (on average 2.3903462749213014) internal successors, (2278), 962 states have internal predecessors, (2278), 0 states have call successors, (0), 0 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 05:22:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2278 transitions. [2022-12-14 05:22:50,718 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2278 transitions. Word has length 20 [2022-12-14 05:22:50,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:50,718 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 2278 transitions. [2022-12-14 05:22:50,718 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 05:22:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2278 transitions. [2022-12-14 05:22:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:22:50,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:50,719 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] [2022-12-14 05:22:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 05:22:50,719 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 329226065, now seen corresponding path program 1 times [2022-12-14 05:22:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467181937] [2022-12-14 05:22:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:50,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467181937] [2022-12-14 05:22:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467181937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:22:50,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:22:50,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:22:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758492932] [2022-12-14 05:22:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:22:50,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:22:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:22:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:22:50,767 INFO L87 Difference]: Start difference. First operand 963 states and 2278 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:50,824 INFO L93 Difference]: Finished difference Result 603 states and 1233 transitions. [2022-12-14 05:22:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:22:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 05:22:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:50,825 INFO L225 Difference]: With dead ends: 603 [2022-12-14 05:22:50,825 INFO L226 Difference]: Without dead ends: 601 [2022-12-14 05:22:50,825 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 05:22:50,825 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:50,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:22:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-14 05:22:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2022-12-14 05:22:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 588 states have (on average 2.0850340136054424) internal successors, (1226), 597 states have internal predecessors, (1226), 0 states have call successors, (0), 0 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 05:22:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1226 transitions. [2022-12-14 05:22:50,834 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1226 transitions. Word has length 23 [2022-12-14 05:22:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:50,834 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1226 transitions. [2022-12-14 05:22:50,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1226 transitions. [2022-12-14 05:22:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:22:50,835 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:50,835 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] [2022-12-14 05:22:50,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 05:22:50,836 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1692750139, now seen corresponding path program 1 times [2022-12-14 05:22:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:50,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699338345] [2022-12-14 05:22:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:50,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:50,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699338345] [2022-12-14 05:22:50,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699338345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:50,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649217374] [2022-12-14 05:22:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:50,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:50,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:22:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:50,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:22:50,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:50,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:51,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649217374] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:51,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1417791544] [2022-12-14 05:22:51,000 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 05:22:51,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:51,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 05:22:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648415625] [2022-12-14 05:22:51,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:51,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:22:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:22:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:22:51,002 INFO L87 Difference]: Start difference. First operand 598 states and 1226 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:51,105 INFO L93 Difference]: Finished difference Result 718 states and 1435 transitions. [2022-12-14 05:22:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:22:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:22:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:51,106 INFO L225 Difference]: With dead ends: 718 [2022-12-14 05:22:51,106 INFO L226 Difference]: Without dead ends: 718 [2022-12-14 05:22:51,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:22:51,107 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:51,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:22:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-12-14 05:22:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 667. [2022-12-14 05:22:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 657 states have (on average 2.04261796042618) internal successors, (1342), 666 states have internal predecessors, (1342), 0 states have call successors, (0), 0 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 05:22:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1342 transitions. [2022-12-14 05:22:51,115 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1342 transitions. Word has length 24 [2022-12-14 05:22:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:51,115 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1342 transitions. [2022-12-14 05:22:51,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1342 transitions. [2022-12-14 05:22:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:22:51,116 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:51,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:51,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:22:51,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:51,317 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:22:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:51,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1418875694, now seen corresponding path program 5 times [2022-12-14 05:22:51,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275120551] [2022-12-14 05:22:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:52,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275120551] [2022-12-14 05:22:52,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275120551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258084960] [2022-12-14 05:22:52,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:22:52,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:52,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:52,977 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:52,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:22:53,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:22:53,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:22:53,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 05:22:53,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:53,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:53,207 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:22:53,207 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 05:22:53,224 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:22:53,224 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 05:22:53,353 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 05:22:53,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:22:53,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 05:22:53,792 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 05:22:53,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:53,884 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 05:22:54,035 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 05:22:54,373 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 70 treesize of output 63 [2022-12-14 05:22:55,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 75 treesize of output 68 [2022-12-14 05:22:55,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:55,580 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 62 treesize of output 64 [2022-12-14 05:22:56,526 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 05:23:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:00,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:23:01,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1741 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-14 05:23:01,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1741) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 05:23:01,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1739) .cse3 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1739) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1741) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-14 05:23:01,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1737 Int) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1737)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1739) .cse1 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1741) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1739))))) is different from false [2022-12-14 05:23:07,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1735 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1739) .cse1 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1741) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 .cse1))) (not (<= v_ArrVal_1735 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1739) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse4 .cse1))))))))) is different from false [2022-12-14 05:23:11,312 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1745 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1735 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1733))) (let ((.cse3 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1739) .cse1 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1735) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1739) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1741))))))))) is different from false [2022-12-14 05:23:11,395 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1732 Int) (v_ArrVal_1745 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1735 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1732)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1733))) (let ((.cse5 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1739) .cse3 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse3))) (not (<= v_ArrVal_1732 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1739) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1735) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1741))))))))) is different from false [2022-12-14 05:23:11,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1732 Int) (v_ArrVal_1745 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1735 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1732)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1733))) (let ((.cse7 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1739) .cse5 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse1) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1732) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse5))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1739) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1735) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1741)))))))))) is different from false [2022-12-14 05:23:11,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1729 Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1732 Int) (v_ArrVal_1745 Int) (v_ArrVal_1735 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1729)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1732)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1733))) (let ((.cse5 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1739) .cse1 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1732) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1735) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse7 .cse1))) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1739) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1741)))))))))) is different from false [2022-12-14 05:23:11,574 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1737 Int) (v_ArrVal_1729 Int) (v_ArrVal_1733 (Array Int Int)) (v_ArrVal_1739 Int) (v_ArrVal_1743 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_141| Int) (v_ArrVal_1741 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1732 Int) (v_ArrVal_1745 Int) (v_ArrVal_1735 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_141| 4)) v_ArrVal_1729)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1732)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1733))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse3 v_ArrVal_1735)) |c_~#stored_elements~0.base| v_ArrVal_1736))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1737))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1739) .cse3 v_ArrVal_1741)) |c_~#stored_elements~0.base| v_ArrVal_1743) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1745) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1741) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1732) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1739) (< (+ (select .cse6 .cse3) 1) v_ArrVal_1735) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_141| (select .cse7 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse3))))))))))))) is different from false [2022-12-14 05:23:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 05:23:11,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258084960] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:23:11,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934154760] [2022-12-14 05:23:11,712 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 05:23:11,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:23:11,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2022-12-14 05:23:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483126825] [2022-12-14 05:23:11,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:23:11,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 05:23:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:23:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 05:23:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1498, Unknown=37, NotChecked=950, Total=2970 [2022-12-14 05:23:11,714 INFO L87 Difference]: Start difference. First operand 667 states and 1342 transitions. Second operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 05:23:21,574 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 05:23:41,062 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 05:23:47,583 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 05:23:49,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 [0] [2022-12-14 05:23:55,094 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 05:24:08,892 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 132 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:24:16,411 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 05:24:18,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:24:20,451 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 05:24:27,126 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 05:24:30,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 [0, 1] [2022-12-14 05:24:32,057 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 05:24:34,387 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 05:24:36,743 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 05:24:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:38,489 INFO L93 Difference]: Finished difference Result 791 states and 1558 transitions. [2022-12-14 05:24:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 05:24:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:24:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:38,490 INFO L225 Difference]: With dead ends: 791 [2022-12-14 05:24:38,490 INFO L226 Difference]: Without dead ends: 791 [2022-12-14 05:24:38,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 83 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 72.7s TimeCoverageRelationStatistics Valid=1359, Invalid=4168, Unknown=63, NotChecked=1550, Total=7140 [2022-12-14 05:24:38,491 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 353 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 55 mSolverCounterUnsat, 100 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 100 IncrementalHoareTripleChecker+Unknown, 978 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:38,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 87 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1197 Invalid, 100 Unknown, 978 Unchecked, 31.4s Time] [2022-12-14 05:24:38,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-12-14 05:24:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 657. [2022-12-14 05:24:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 647 states have (on average 2.0664605873261204) internal successors, (1337), 656 states have internal predecessors, (1337), 0 states have call successors, (0), 0 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 05:24:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1337 transitions. [2022-12-14 05:24:38,498 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1337 transitions. Word has length 24 [2022-12-14 05:24:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:38,498 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 1337 transitions. [2022-12-14 05:24:38,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 05:24:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1337 transitions. [2022-12-14 05:24:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:24:38,499 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:38,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:38,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 05:24:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 05:24:38,700 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:24:38,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1511915428, now seen corresponding path program 6 times [2022-12-14 05:24:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:38,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435164232] [2022-12-14 05:24:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:39,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435164232] [2022-12-14 05:24:39,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435164232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880026093] [2022-12-14 05:24:39,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:24:39,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:39,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:39,831 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:39,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:24:39,984 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:24:39,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:24:39,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 05:24:39,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:40,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:40,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:40,010 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:24:40,010 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 05:24:40,027 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:24:40,028 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 05:24:40,120 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 05:24:40,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:24:40,402 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 05:24:40,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 05:24:40,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:40,580 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 05:24:40,718 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 05:24:41,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-12-14 05:24:41,463 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 05:24:47,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:47,256 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 62 treesize of output 64 [2022-12-14 05:24:48,052 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 05:24:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:58,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:24:58,452 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1868))))) is different from false [2022-12-14 05:25:00,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1866) .cse2 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1868) (< (+ 1 (select .cse1 .cse3)) v_ArrVal_1866))))) is different from false [2022-12-14 05:25:00,634 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1864)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1866) .cse2 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1866) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1868) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 05:25:05,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1866) .cse3 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1868) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1866))))))) is different from false [2022-12-14 05:25:05,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1868) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1866))))))) is different from false [2022-12-14 05:25:05,404 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (not (<= v_ArrVal_1859 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1866) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1868) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse4 .cse1))))))))) is different from false [2022-12-14 05:25:05,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1866) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1868) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1859)))))))) is different from false [2022-12-14 05:25:05,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1858) .cse7 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1868) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1866) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 .cse1))) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_1858) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse6 .cse1))) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1859)))))))) is different from false [2022-12-14 05:25:05,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1856 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1856)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse7 v_ArrVal_1858) .cse3 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864)) (.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1866) .cse5 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1859) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1866) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1868) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse6 .cse5))) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1858) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse5)))))))))) is different from false [2022-12-14 05:25:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-14 05:25:15,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880026093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:15,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933126544] [2022-12-14 05:25:15,396 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 05:25:15,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:15,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2022-12-14 05:25:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27209897] [2022-12-14 05:25:15,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:25:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 05:25:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 05:25:15,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1583, Unknown=42, NotChecked=864, Total=2970 [2022-12-14 05:25:15,399 INFO L87 Difference]: Start difference. First operand 657 states and 1337 transitions. Second operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 05:25:21,417 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 05:25:27,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:25:40,782 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 176 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:25:45,552 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 05:25:47,586 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 05:26:20,798 WARN L233 SmtUtils]: Spent 13.59s on a formula simplification. DAG size of input: 244 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:26:22,806 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 05:26:24,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 [0] [2022-12-14 05:26:26,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:26:41,333 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 05:26:43,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:27:07,783 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 207 DAG size of output: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:27:10,539 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 05:27:12,625 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 05:27:15,262 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 05:27:17,295 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 05:27:19,302 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 05:27:21,348 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 05:27:24,060 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 05:27:26,083 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 05:27:28,089 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 05:27:30,100 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 05:27:32,106 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 05:27:34,111 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 05:27:36,268 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 05:27:38,294 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 05:27:40,352 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 05:27:42,450 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 05:27:44,457 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 05:27:46,469 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 05:27:54,807 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 05:27:56,816 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 05:28:32,365 WARN L233 SmtUtils]: Spent 23.76s on a formula simplification. DAG size of input: 203 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:28:34,384 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 05:28:36,392 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 05:28:38,399 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 05:28:40,407 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 05:28:42,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 [0, 1] [2022-12-14 05:28:44,419 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 05:28:46,428 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 05:28:48,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 [0, 1] [2022-12-14 05:28:50,441 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 05:28:52,447 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 05:28:54,457 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 05:28:56,464 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 05:28:58,474 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 05:29:04,308 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 184 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:29:06,979 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 05:29:24,154 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:29:45,687 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 163 DAG size of output: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:29:48,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:30:00,496 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:30:26,582 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 05:30:28,639 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 05:30:59,638 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 05:31:02,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 05:31:05,337 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 05:31:20,406 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 05:31:22,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 05:31:24,477 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 05:31:26,490 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 05:31:28,497 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 05:31:28,510 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1864)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1866) .cse2 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1866) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1868) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 .cse5))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_1866) .cse5 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse6 .cse4) 1) v_ArrVal_1866) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse7 .cse5))) (< (select (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse4) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_1868) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse8 .cse5)))))))))) is different from false [2022-12-14 05:31:30,520 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 05:31:32,527 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 05:31:44,930 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 05:31:49,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 05:31:51,215 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 05:31:57,556 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 05:31:59,560 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 05:32:01,565 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 05:32:03,570 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 05:32:05,575 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 05:32:10,164 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 05:32:12,193 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 05:32:14,550 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 05:32:16,565 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 05:32:18,593 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 05:32:19,306 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (select .cse0 .cse1) 2) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1866) .cse3 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1866 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1868))))))) is different from false [2022-12-14 05:32:26,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:32:26,211 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select .cse6 .cse7))) (let ((.cse5 (+ 1 .cse0)) (.cse4 (+ (select .cse6 .cse8) 1)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= .cse0 2) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1866) .cse8 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse1 .cse3))) (< .cse4 v_ArrVal_1868) (< .cse5 v_ArrVal_1866)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1858) .cse8 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse11 (select .cse12 |c_~#queue~0.base|))) (let ((.cse9 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse10 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse2 v_ArrVal_1866) .cse3 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse9 .cse3) 1) v_ArrVal_1868) (< (+ (select .cse9 .cse2) 1) v_ArrVal_1866) (< (select (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse10 .cse3))) (< .cse5 v_ArrVal_1858) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse11 .cse3))) (< .cse4 v_ArrVal_1859))))))))))) is different from false [2022-12-14 05:32:27,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 05:32:27,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) (.cse4 (+ (select .cse5 .cse7) 1)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1866) .cse7 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1866 .cse0)) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse1 .cse3))) (< .cse4 v_ArrVal_1868)))) (forall ((v_ArrVal_1859 Int) (v_ArrVal_1858 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1858) .cse7 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse9 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_1866) .cse3 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (< (+ (select .cse8 .cse3) 1) v_ArrVal_1868) (< (+ (select .cse8 .cse2) 1) v_ArrVal_1866) (< (select (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse9 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse10 .cse3))) (not (<= v_ArrVal_1858 .cse0)) (< .cse4 v_ArrVal_1859)))))))))) is different from false [2022-12-14 05:32:29,963 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 05:32:30,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ (select .cse7 .cse8) 1))) (and (forall ((v_ArrVal_1859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1866) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1868) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse4 .cse1))) (< .cse5 v_ArrVal_1859))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse9 .cse1))) (< (select (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse3) 2147483647) (< .cse5 v_ArrVal_1868))))))) is different from false [2022-12-14 05:32:32,121 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 05:32:32,172 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1859)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (not (<= v_ArrVal_1859 .cse2)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1866) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1868) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse5 .cse1))))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1868 .cse2)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse9 .cse1))) (< (select (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse4) 2147483647)))))) is different from false [2022-12-14 05:32:33,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1870 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1862 (Array Int Int)) (v_ArrVal_1861 (Array Int Int)) (v_ArrVal_1870 Int) (v_ArrVal_1864 Int) (v_ArrVal_1866 Int) (v_ArrVal_1868 Int) (v_ArrVal_1869 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1861) |c_~#stored_elements~0.base| v_ArrVal_1862))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) v_ArrVal_1864))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1866) .cse1 v_ArrVal_1868)) |c_~#stored_elements~0.base| v_ArrVal_1869) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1868) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1870) .cse2) 2147483647) (< (+ (select .cse5 .cse2) 1) v_ArrVal_1866))))))))) is different from false [2022-12-14 05:32:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:32:33,565 INFO L93 Difference]: Finished difference Result 857 states and 1673 transitions. [2022-12-14 05:32:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-14 05:32:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:32:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:32:33,566 INFO L225 Difference]: With dead ends: 857 [2022-12-14 05:32:33,566 INFO L226 Difference]: Without dead ends: 857 [2022-12-14 05:32:33,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 309.1s TimeCoverageRelationStatistics Valid=1513, Invalid=5374, Unknown=149, NotChecked=2864, Total=9900 [2022-12-14 05:32:33,567 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 418 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 80 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 162.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 1027 IncrementalHoareTripleChecker+Unchecked, 163.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:32:33,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 89 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1367 Invalid, 140 Unknown, 1027 Unchecked, 163.2s Time] [2022-12-14 05:32:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-12-14 05:32:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 738. [2022-12-14 05:32:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 728 states have (on average 2.0576923076923075) internal successors, (1498), 737 states have internal predecessors, (1498), 0 states have call successors, (0), 0 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 05:32:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1498 transitions. [2022-12-14 05:32:33,574 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1498 transitions. Word has length 24 [2022-12-14 05:32:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:32:33,575 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1498 transitions. [2022-12-14 05:32:33,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 05:32:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1498 transitions. [2022-12-14 05:32:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:32:33,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:32:33,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:32:33,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:32:33,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 05:32:33,777 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 05:32:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:32:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1453030992, now seen corresponding path program 7 times [2022-12-14 05:32:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:32:33,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797638706] [2022-12-14 05:32:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:32:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:32:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:32:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:32:34,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:32:34,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797638706] [2022-12-14 05:32:34,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797638706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:32:34,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948976642] [2022-12-14 05:32:34,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:32:34,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:32:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:32:34,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:32:34,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14aed032-4ef6-49ea-bfc3-7600e0a7fcd5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:32:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:32:35,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 05:32:35,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:32:35,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:32:35,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:32:35,078 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:32:35,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 05:32:35,097 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 05:32:35,097 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 05:32:35,212 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 05:32:35,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 05:32:35,484 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 05:32:35,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:32:35,572 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 05:32:35,713 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 05:32:36,041 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 70 treesize of output 63 [2022-12-14 05:32:36,351 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 05:32:37,060 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 05:32:39,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:32:39,294 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 62 treesize of output 64 [2022-12-14 05:32:42,365 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 05:32:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:32:52,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:32:53,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1997 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 (+ |c_~#queue~0.offset| 3204))))))) is different from false [2022-12-14 05:32:55,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 (+ |c_~#queue~0.offset| 3204)))))))) is different from false [2022-12-14 05:32:55,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-14 05:32:55,248 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (not (<= v_ArrVal_1990 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 (+ |c_~#queue~0.offset| 3204))))))))) is different from false [2022-12-14 05:32:55,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 (+ |c_~#queue~0.offset| 3204)))) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_1990))))))) is different from false [2022-12-14 05:32:55,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1989)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 (+ |c_~#queue~0.offset| 3204)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1990) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1994))))))) is different from false [2022-12-14 05:32:55,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1990) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1994) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 .cse1)))))))))) is different from false [2022-12-14 05:32:55,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1990) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1994) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse5 .cse1))))))))))) is different from false [2022-12-14 05:32:55,407 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1986 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1986)) |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1990) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 .cse1))) (not (<= v_ArrVal_1986 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))))))) is different from false [2022-12-14 05:32:55,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1986 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1986)) |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1994) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1990) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1986)))))))))) is different from false [2022-12-14 05:32:55,557 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1986 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1983) .cse7 v_ArrVal_1986)) |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1994) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1990) (not (<= v_ArrVal_1983 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 .cse3)))))))))))) is different from false [2022-12-14 05:32:55,619 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1994 Int) (v_ArrVal_1986 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1983) .cse8 v_ArrVal_1986)) |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse5 .cse1 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1994) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1990) (< (+ 1 (select .cse6 .cse7)) v_ArrVal_1983) (< (+ (select .cse6 .cse8) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 .cse3)))))))))))) is different from false [2022-12-14 05:32:55,681 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1995 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1990 Int) (v_ArrVal_1981 Int) (v_ArrVal_1983 Int) (v_ArrVal_1994 Int) (v_ArrVal_1986 Int) (v_ArrVal_1997 Int) (v_ArrVal_1989 Int)) (let ((.cse5 (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_1981)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse8 v_ArrVal_1983) .cse6 v_ArrVal_1986)) |c_~#stored_elements~0.base| v_ArrVal_1987))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1989)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1994)) |c_~#stored_elements~0.base| v_ArrVal_1995) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1990) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1994) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse7 .cse3))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1997) .cse1) 2147483647) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1983)))))))))) is different from false [2022-12-14 05:33:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-14 05:33:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948976642] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:33:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624221325] [2022-12-14 05:33:00,549 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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 05:33:00,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:33:00,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2022-12-14 05:33:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644349152] [2022-12-14 05:33:00,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:33:00,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-14 05:33:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:33:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-14 05:33:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1306, Unknown=23, NotChecked=1196, Total=2970 [2022-12-14 05:33:00,551 INFO L87 Difference]: Start difference. First operand 738 states and 1498 transitions. Second operand has 55 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 05:33:08,631 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 05:33:23,766 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 05:33:27,093 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 05:33:29,556 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 05:33:34,270 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 05:33:40,904 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 05:33:42,910 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 05:33:44,923 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]