./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur --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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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-38b53e6 [2022-11-25 22:27:52,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:27:52,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:27:52,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:27:52,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:27:52,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:27:52,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:27:52,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:27:52,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:27:52,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:27:52,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:27:52,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:27:52,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:27:52,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:27:52,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:27:52,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:27:52,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:27:52,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:27:52,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:27:52,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:27:52,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:27:52,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:27:52,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:27:52,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:27:52,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:27:52,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:27:52,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:27:52,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:27:52,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:27:52,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:27:52,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:27:52,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:27:52,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:27:52,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:27:52,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:27:52,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:27:52,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:27:52,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:27:52,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:27:52,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:27:52,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:27:52,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 22:27:52,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:27:52,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:27:52,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:27:52,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:27:52,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:27:52,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:27:52,422 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:27:52,422 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:27:52,422 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:27:52,422 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:27:52,423 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:27:52,423 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:27:52,424 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:27:52,424 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:27:52,424 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:27:52,424 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:27:52,424 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:27:52,424 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:27:52,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:27:52,425 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:27:52,425 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:27:52,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:27:52,427 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 22:27:52,427 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:27:52,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:27:52,427 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:27:52,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:27:52,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:27:52,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:27:52,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:52,428 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:27:52,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:27:52,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:27:52,430 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_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/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_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-25 22:27:52,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:27:52,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:27:52,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:27:52,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:27:52,802 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:27:52,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 22:27:55,843 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:27:56,163 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:27:56,163 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/sv-benchmarks/c/pthread/queue_ok.i [2022-11-25 22:27:56,180 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/data/a576bcecc/bb3d300daae045e5bbd30687872a5176/FLAGad861c433 [2022-11-25 22:27:56,206 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/data/a576bcecc/bb3d300daae045e5bbd30687872a5176 [2022-11-25 22:27:56,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:27:56,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:27:56,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:56,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:27:56,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:27:56,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:56" (1/1) ... [2022-11-25 22:27:56,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63713dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:56, skipping insertion in model container [2022-11-25 22:27:56,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:27:56" (1/1) ... [2022-11-25 22:27:56,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:27:56,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:27:56,882 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_d395d214-8e88-4052-ae8b-148faab0c5d5/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 22:27:56,888 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_d395d214-8e88-4052-ae8b-148faab0c5d5/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 22:27:56,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:56,908 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:27:56,949 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_d395d214-8e88-4052-ae8b-148faab0c5d5/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-25 22:27:56,952 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_d395d214-8e88-4052-ae8b-148faab0c5d5/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-25 22:27:56,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:27:57,027 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:27:57,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57 WrapperNode [2022-11-25 22:27:57,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:27:57,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:57,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:27:57,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:27:57,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,091 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 22:27:57,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:27:57,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:27:57,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:27:57,095 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:27:57,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:27:57,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:27:57,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:27:57,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:27:57,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (1/1) ... [2022-11-25 22:27:57,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:27:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:27:57,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:27:57,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:27:57,235 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 22:27:57,235 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 22:27:57,235 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 22:27:57,235 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:27:57,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:27:57,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:27:57,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:27:57,238 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 22:27:57,432 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:27:57,434 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:27:57,876 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:27:57,885 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:27:57,897 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 22:27:57,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:57 BoogieIcfgContainer [2022-11-25 22:27:57,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:27:57,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:27:57,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:27:57,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:27:57,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:27:56" (1/3) ... [2022-11-25 22:27:57,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28962068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:57, skipping insertion in model container [2022-11-25 22:27:57,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:27:57" (2/3) ... [2022-11-25 22:27:57,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28962068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:27:57, skipping insertion in model container [2022-11-25 22:27:57,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:27:57" (3/3) ... [2022-11-25 22:27:57,922 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-25 22:27:57,932 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 22:27:57,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:27:57,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 22:27:57,943 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 22:27:58,060 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 22:27:58,098 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 22:27:58,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-25 22:27:58,116 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-25 22:27:58,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 22:27:58,263 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-25 22:27:58,264 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 22:27:58,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 22:27:58,280 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-25 22:28:09,285 INFO L134 LiptonReduction]: Checked pairs total: 29976 [2022-11-25 22:28:09,285 INFO L136 LiptonReduction]: Total number of compositions: 235 [2022-11-25 22:28:09,294 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-25 22:28:09,375 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:09,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:28:09,403 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;@73d6f61b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:28:09,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 22:28:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 22:28:09,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:09,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:09,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:09,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:09,423 INFO L85 PathProgramCache]: Analyzing trace with hash -261748653, now seen corresponding path program 1 times [2022-11-25 22:28:09,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:09,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515741619] [2022-11-25 22:28:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:10,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:10,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515741619] [2022-11-25 22:28:10,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515741619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:10,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:10,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:10,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619788397] [2022-11-25 22:28:10,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:10,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:28:10,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:28:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:10,829 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:11,201 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-25 22:28:11,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 22:28:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:11,241 INFO L225 Difference]: With dead ends: 1168 [2022-11-25 22:28:11,241 INFO L226 Difference]: Without dead ends: 1168 [2022-11-25 22:28:11,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11-25 22:28:11,248 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:11,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-25 22:28:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-25 22:28:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-25 22:28:11,413 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-25 22:28:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:11,414 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-25 22:28:11,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-25 22:28:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:28:11,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:11,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:11,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:28:11,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:11,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131929, now seen corresponding path program 1 times [2022-11-25 22:28:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:11,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553694127] [2022-11-25 22:28:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:12,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:12,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553694127] [2022-11-25 22:28:12,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553694127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:12,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:12,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237513592] [2022-11-25 22:28:12,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:12,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:12,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:12,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:12,399 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:12,812 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-25 22:28:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:28:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:12,827 INFO L225 Difference]: With dead ends: 1537 [2022-11-25 22:28:12,828 INFO L226 Difference]: Without dead ends: 1537 [2022-11-25 22:28:12,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:12,829 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:12,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:28:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-25 22:28:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-25 22:28:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 22:28:12,900 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 22:28:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:12,900 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 22:28:12,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 22:28:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:28:12,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:12,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:12,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:28:12,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:12,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 475825829, now seen corresponding path program 2 times [2022-11-25 22:28:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:12,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829497714] [2022-11-25 22:28:12,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:14,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829497714] [2022-11-25 22:28:14,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829497714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:14,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:14,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:14,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529425441] [2022-11-25 22:28:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:14,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:14,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:14,011 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:14,738 INFO L93 Difference]: Finished difference Result 1572 states and 4148 transitions. [2022-11-25 22:28:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:28:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:14,750 INFO L225 Difference]: With dead ends: 1572 [2022-11-25 22:28:14,750 INFO L226 Difference]: Without dead ends: 1572 [2022-11-25 22:28:14,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:14,751 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:14,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:28:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-25 22:28:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1328. [2022-11-25 22:28:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:14,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 22:28:14,810 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 22:28:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:14,810 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 22:28:14,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 22:28:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 22:28:14,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:14,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:14,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:28:14,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 475729109, now seen corresponding path program 3 times [2022-11-25 22:28:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:14,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226772323] [2022-11-25 22:28:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:14,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:15,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:15,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226772323] [2022-11-25 22:28:15,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226772323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:15,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:15,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042938625] [2022-11-25 22:28:15,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:15,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:15,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:15,891 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:16,553 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-25 22:28:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 22:28:16,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:16,564 INFO L225 Difference]: With dead ends: 1537 [2022-11-25 22:28:16,564 INFO L226 Difference]: Without dead ends: 1537 [2022-11-25 22:28:16,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:16,569 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:16,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:28:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-25 22:28:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-25 22:28:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 22:28:16,629 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 22:28:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:16,629 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 22:28:16,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 22:28:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:28:16,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:16,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:28:16,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1933921403, now seen corresponding path program 1 times [2022-11-25 22:28:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:16,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310964675] [2022-11-25 22:28:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:16,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310964675] [2022-11-25 22:28:16,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310964675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:16,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:16,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329837473] [2022-11-25 22:28:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:16,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:16,732 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:16,985 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-25 22:28:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 22:28:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:17,000 INFO L225 Difference]: With dead ends: 2154 [2022-11-25 22:28:17,000 INFO L226 Difference]: Without dead ends: 2154 [2022-11-25 22:28:17,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:17,001 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:17,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 26 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-25 22:28:17,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-25 22:28:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-25 22:28:17,079 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-25 22:28:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:17,081 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-25 22:28:17,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-25 22:28:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 22:28:17,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:17,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:17,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:28:17,084 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:17,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1903415787, now seen corresponding path program 1 times [2022-11-25 22:28:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133049811] [2022-11-25 22:28:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:17,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:17,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133049811] [2022-11-25 22:28:17,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133049811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:17,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:17,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480807175] [2022-11-25 22:28:17,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:17,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:28:17,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:28:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:17,501 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:17,686 INFO L93 Difference]: Finished difference Result 1958 states and 5491 transitions. [2022-11-25 22:28:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 22:28:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:17,698 INFO L225 Difference]: With dead ends: 1958 [2022-11-25 22:28:17,698 INFO L226 Difference]: Without dead ends: 1958 [2022-11-25 22:28:17,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-25 22:28:17,699 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:17,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-11-25 22:28:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1953. [2022-11-25 22:28:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-25 22:28:17,764 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-25 22:28:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:17,765 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-25 22:28:17,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-25 22:28:17,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:28:17,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:17,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:17,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:28:17,768 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -155840155, now seen corresponding path program 1 times [2022-11-25 22:28:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:17,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059978483] [2022-11-25 22:28:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:18,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:18,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059978483] [2022-11-25 22:28:18,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059978483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:18,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884442187] [2022-11-25 22:28:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:18,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:18,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:18,479 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:18,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:18,854 INFO L93 Difference]: Finished difference Result 2456 states and 6770 transitions. [2022-11-25 22:28:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:28:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:18,868 INFO L225 Difference]: With dead ends: 2456 [2022-11-25 22:28:18,869 INFO L226 Difference]: Without dead ends: 2456 [2022-11-25 22:28:18,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:28:18,870 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:18,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:28:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2022-11-25 22:28:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2198. [2022-11-25 22:28:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2150 states have (on average 2.8567441860465115) internal successors, (6142), 2197 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 6142 transitions. [2022-11-25 22:28:18,942 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 6142 transitions. Word has length 11 [2022-11-25 22:28:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:18,942 INFO L495 AbstractCegarLoop]: Abstraction has 2198 states and 6142 transitions. [2022-11-25 22:28:18,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 6142 transitions. [2022-11-25 22:28:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:28:18,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:18,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:18,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 22:28:18,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1222541532, now seen corresponding path program 1 times [2022-11-25 22:28:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248271947] [2022-11-25 22:28:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:18,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:18,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248271947] [2022-11-25 22:28:18,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248271947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:18,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:18,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:28:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126782799] [2022-11-25 22:28:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:18,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:28:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:28:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:18,999 INFO L87 Difference]: Start difference. First operand 2198 states and 6142 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:19,091 INFO L93 Difference]: Finished difference Result 614 states and 1423 transitions. [2022-11-25 22:28:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:28:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:28:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:19,095 INFO L225 Difference]: With dead ends: 614 [2022-11-25 22:28:19,095 INFO L226 Difference]: Without dead ends: 592 [2022-11-25 22:28:19,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:28:19,097 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:19,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:28:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-25 22:28:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-11-25 22:28:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-25 22:28:19,117 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-25 22:28:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:19,118 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-25 22:28:19,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-25 22:28:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:28:19,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:19,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:19,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 22:28:19,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1932122713, now seen corresponding path program 2 times [2022-11-25 22:28:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:19,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104509462] [2022-11-25 22:28:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:19,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:19,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104509462] [2022-11-25 22:28:19,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104509462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:19,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:19,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323343432] [2022-11-25 22:28:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:19,948 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:20,334 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-25 22:28:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:28:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:20,339 INFO L225 Difference]: With dead ends: 820 [2022-11-25 22:28:20,339 INFO L226 Difference]: Without dead ends: 820 [2022-11-25 22:28:20,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-25 22:28:20,340 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:20,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:28:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-25 22:28:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-25 22:28:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-25 22:28:20,360 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-25 22:28:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:20,360 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-25 22:28:20,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-25 22:28:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:28:20,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:20,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:20,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:28:20,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1121752697, now seen corresponding path program 3 times [2022-11-25 22:28:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917592628] [2022-11-25 22:28:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:20,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:20,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917592628] [2022-11-25 22:28:20,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917592628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:20,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:20,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:28:20,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955289344] [2022-11-25 22:28:20,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:20,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:28:20,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:28:20,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:28:20,924 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:21,156 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2022-11-25 22:28:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:28:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 22:28:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:21,161 INFO L225 Difference]: With dead ends: 798 [2022-11-25 22:28:21,161 INFO L226 Difference]: Without dead ends: 798 [2022-11-25 22:28:21,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-25 22:28:21,162 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:21,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 17 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:28:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-25 22:28:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 570. [2022-11-25 22:28:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-25 22:28:21,181 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-25 22:28:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:21,182 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-25 22:28:21,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-25 22:28:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:28:21,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:21,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:21,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:28:21,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1796091972, now seen corresponding path program 1 times [2022-11-25 22:28:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:21,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359169456] [2022-11-25 22:28:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:21,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:21,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359169456] [2022-11-25 22:28:21,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359169456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:28:21,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:28:21,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:28:21,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298164429] [2022-11-25 22:28:21,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:28:21,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:28:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:21,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:28:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:28:21,246 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:21,404 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-25 22:28:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:28:21,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 22:28:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:21,407 INFO L225 Difference]: With dead ends: 606 [2022-11-25 22:28:21,408 INFO L226 Difference]: Without dead ends: 606 [2022-11-25 22:28:21,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:28:21,409 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:21,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:28:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-25 22:28:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-25 22:28:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-25 22:28:21,424 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-25 22:28:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:21,425 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-25 22:28:21,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-25 22:28:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:28:21,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:21,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:28:21,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -664587904, now seen corresponding path program 1 times [2022-11-25 22:28:21,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130084634] [2022-11-25 22:28:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:22,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130084634] [2022-11-25 22:28:22,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130084634] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:28:22,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163790777] [2022-11-25 22:28:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:22,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:22,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:22,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:22,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:28:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 22:28:23,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:23,176 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:28:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:28:23,198 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:28:23,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:28:23,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:28:23,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 22:28:23,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 22:28:24,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:24,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 22:28:24,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 22:28:25,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-11-25 22:28:25,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:25,397 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_438 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-25 22:28:26,923 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_435) .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_438) (not (<= v_ArrVal_435 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 22:28:29,229 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_ArrVal_435 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_433)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |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_435) .cse2 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_438) (< (+ (select .cse1 .cse3) 1) v_ArrVal_435))))) is different from false [2022-11-25 22:28:37,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:28:37,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163790777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:37,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502477134] [2022-11-25 22:28:37,601 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-11-25 22:28:37,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:28:37,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-25 22:28:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054305929] [2022-11-25 22:28:37,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:28:37,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 22:28:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:37,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 22:28:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=581, Unknown=24, NotChecked=168, Total=992 [2022-11-25 22:28:37,612 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:45,470 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-11-25 22:28:47,481 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-11-25 22:28:47,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_438 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 .cse2)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse5 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_438)))))) is different from false [2022-11-25 22:28:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:48,753 INFO L93 Difference]: Finished difference Result 643 states and 1475 transitions. [2022-11-25 22:28:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 22:28:48,754 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:28:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:48,758 INFO L225 Difference]: With dead ends: 643 [2022-11-25 22:28:48,759 INFO L226 Difference]: Without dead ends: 643 [2022-11-25 22:28:48,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=431, Invalid=1119, Unknown=26, NotChecked=316, Total=1892 [2022-11-25 22:28:48,760 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 14 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 137 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 950 Invalid, 28 Unknown, 267 Unchecked, 6.2s Time] [2022-11-25 22:28:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-25 22:28:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 618. [2022-11-25 22:28:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 600 states have (on average 2.3983333333333334) internal successors, (1439), 617 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1439 transitions. [2022-11-25 22:28:48,782 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1439 transitions. Word has length 16 [2022-11-25 22:28:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:48,782 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1439 transitions. [2022-11-25 22:28:48,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1439 transitions. [2022-11-25 22:28:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:28:48,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:48,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:48,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 22:28:48,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:48,991 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash -664587903, now seen corresponding path program 1 times [2022-11-25 22:28:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063965145] [2022-11-25 22:28:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:50,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063965145] [2022-11-25 22:28:50,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063965145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:28:50,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794363012] [2022-11-25 22:28:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:50,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:50,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:28:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:50,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 22:28:50,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:50,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:28:51,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 22:28:51,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:51,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:28:51,228 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:28:51,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 22:28:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:51,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:28:51,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 Int) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_520 (Array Int Int))) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_520) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_522) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_522 2147483648) 0))) is different from false [2022-11-25 22:28:51,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:51,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-25 22:28:51,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:51,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-11-25 22:28:51,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 22:28:51,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:28:51,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:28:51,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-11-25 22:28:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:51,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794363012] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:28:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176578511] [2022-11-25 22:28:51,956 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-11-25 22:28:51,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:28:51,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2022-11-25 22:28:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405797384] [2022-11-25 22:28:51,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:28:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 22:28:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:28:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 22:28:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=447, Unknown=5, NotChecked=44, Total=600 [2022-11-25 22:28:51,959 INFO L87 Difference]: Start difference. First operand 618 states and 1439 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:28:54,540 INFO L93 Difference]: Finished difference Result 1782 states and 4121 transitions. [2022-11-25 22:28:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:28:54,541 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 22:28:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:28:54,551 INFO L225 Difference]: With dead ends: 1782 [2022-11-25 22:28:54,551 INFO L226 Difference]: Without dead ends: 1782 [2022-11-25 22:28:54,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=861, Unknown=5, NotChecked=66, Total=1260 [2022-11-25 22:28:54,552 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 558 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:28:54,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 144 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1169 Invalid, 0 Unknown, 89 Unchecked, 1.7s Time] [2022-11-25 22:28:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-11-25 22:28:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 782. [2022-11-25 22:28:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 764 states have (on average 2.462041884816754) internal successors, (1881), 781 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1881 transitions. [2022-11-25 22:28:54,590 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1881 transitions. Word has length 16 [2022-11-25 22:28:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:28:54,590 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1881 transitions. [2022-11-25 22:28:54,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:28:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1881 transitions. [2022-11-25 22:28:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:28:54,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:28:54,592 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:28:54,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:28:54,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 22:28:54,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:28:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:28:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688262, now seen corresponding path program 1 times [2022-11-25 22:28:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:28:54,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241217042] [2022-11-25 22:28:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:28:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:56,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:28:56,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241217042] [2022-11-25 22:28:56,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241217042] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:28:56,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122327564] [2022-11-25 22:28:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:28:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:28:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:28:56,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:28:56,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:28:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:28:56,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-25 22:28:56,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:28:56,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 22:28:56,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:56,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:56,993 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:28:56,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-25 22:28:57,040 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:28:57,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:28:57,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 22:28:57,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:28:57,354 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-25 22:28:57,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-25 22:28:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:57,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:28:57,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-25 22:28:57,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-25 22:28:57,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:28:57,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 22:28:57,972 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 22:28:57,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-25 22:28:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:28:58,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:00,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_617 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 22:29:00,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_615 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_615) .cse1 v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_617) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_615 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 22:29:02,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_615 Int) (v_ArrVal_613 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_613)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_615) .cse1 v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_617) (< (+ (select .cse0 .cse2) 1) v_ArrVal_615) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse3 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 22:29:11,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_615 Int) (v_ArrVal_613 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_612))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_613)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_615) .cse1 v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_615) (< (+ (select .cse2 .cse1) 1) v_ArrVal_617) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse4 .cse1))))))))) is different from false [2022-11-25 22:29:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:29:11,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122327564] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098417986] [2022-11-25 22:29:11,190 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-11-25 22:29:11,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:29:11,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 22:29:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171033925] [2022-11-25 22:29:11,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:11,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 22:29:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:29:11,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 22:29:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=687, Unknown=23, NotChecked=244, Total=1190 [2022-11-25 22:29:11,199 INFO L87 Difference]: Start difference. First operand 782 states and 1881 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:29:17,224 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-11-25 22:29:19,239 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-11-25 22:29:21,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:26,935 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-11-25 22:29:27,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_617) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) .cse4) 2147483647)))) (forall ((v_ArrVal_620 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| Int) (v_ArrVal_617 Int) (v_ArrVal_619 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_617)) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| (select .cse5 .cse1))) (not (<= v_ArrVal_617 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_144| 4) |c_~#queue~0.offset|) v_ArrVal_620) .cse4) 2147483647)))))) is different from false [2022-11-25 22:29:29,981 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-11-25 22:29:32,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:34,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:36,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:37,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:39,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:41,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:42,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:29:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:29:42,763 INFO L93 Difference]: Finished difference Result 1340 states and 3183 transitions. [2022-11-25 22:29:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 22:29:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:29:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:29:42,768 INFO L225 Difference]: With dead ends: 1340 [2022-11-25 22:29:42,768 INFO L226 Difference]: Without dead ends: 1340 [2022-11-25 22:29:42,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=488, Invalid=1307, Unknown=31, NotChecked=430, Total=2256 [2022-11-25 22:29:42,769 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 447 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 31 mSolverCounterUnsat, 123 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 123 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:29:42,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 219 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1425 Invalid, 123 Unknown, 490 Unchecked, 24.8s Time] [2022-11-25 22:29:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-11-25 22:29:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 914. [2022-11-25 22:29:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 896 states have (on average 2.5066964285714284) internal successors, (2246), 913 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:29:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 2246 transitions. [2022-11-25 22:29:42,807 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 2246 transitions. Word has length 17 [2022-11-25 22:29:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:29:42,807 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 2246 transitions. [2022-11-25 22:29:42,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:29:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 2246 transitions. [2022-11-25 22:29:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:29:42,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:29:42,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:29:42,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 22:29:43,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:43,015 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:29:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:29:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643676, now seen corresponding path program 2 times [2022-11-25 22:29:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:29:43,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050071913] [2022-11-25 22:29:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:29:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:29:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:29:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:44,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:29:44,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050071913] [2022-11-25 22:29:44,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050071913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:29:44,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294242451] [2022-11-25 22:29:44,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:29:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:29:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:29:44,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:29:44,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:29:44,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 22:29:44,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:29:44,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 22:29:44,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:29:44,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:29:44,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:29:44,569 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:29:44,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:29:44,603 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:29:44,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:29:44,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-25 22:29:44,930 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 73 treesize of output 66 [2022-11-25 22:29:45,023 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 60 treesize of output 62 [2022-11-25 22:29:45,226 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 54 treesize of output 47 [2022-11-25 22:29:45,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:29:45,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-25 22:29:45,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-11-25 22:29:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:29:45,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:29:45,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_723 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 22:29:46,023 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_720) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-11-25 22:29:46,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_723 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_720) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_717 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-25 22:29:46,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_723 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ 1 (select .cse1 .cse2)) v_ArrVal_720) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_717))))))) is different from false [2022-11-25 22:29:46,154 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_716 Int) (v_ArrVal_723 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_716)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_720) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_717))))))) is different from false [2022-11-25 22:29:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:29:46,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294242451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:29:46,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1709943432] [2022-11-25 22:29:46,412 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-11-25 22:29:46,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:29:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 22:29:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659356601] [2022-11-25 22:29:46,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:29:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 22:29:46,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:29:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 22:29:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=642, Unknown=17, NotChecked=300, Total=1190 [2022-11-25 22:29:46,417 INFO L87 Difference]: Start difference. First operand 914 states and 2246 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:29:49,785 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-11-25 22:29:51,792 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-11-25 22:29:53,964 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-11-25 22:29:56,741 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-11-25 22:29:58,747 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-11-25 22:30:00,756 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-11-25 22:30:02,767 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-11-25 22:30:04,774 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-11-25 22:30:06,803 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-11-25 22:30:09,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:30:10,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:30:13,024 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-11-25 22:30:18,763 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-11-25 22:30:20,776 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-11-25 22:30:21,149 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_716 Int) (v_ArrVal_723 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_716)) (.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse2 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_720) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse4))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_717))))))) (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_717 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_716 Int) (v_ArrVal_723 Int)) (let ((.cse9 (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_716)))) (let ((.cse11 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse1 v_ArrVal_717)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_719))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store .cse8 .cse4 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (< (+ (select .cse8 .cse4) 1) v_ArrVal_720) (< (+ (select .cse9 .cse1) 1) v_ArrVal_717) (< (select (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse10 .cse4))))))))))) is different from false [2022-11-25 22:30:23,160 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-11-25 22:30:25,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:30:27,175 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-11-25 22:30:29,191 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-11-25 22:30:31,217 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-11-25 22:30:33,224 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-11-25 22:30:35,236 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-11-25 22:30:37,241 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-11-25 22:30:39,259 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-11-25 22:30:41,264 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-11-25 22:30:43,270 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-11-25 22:30:45,284 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-11-25 22:30:54,543 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-11-25 22:30:57,068 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-11-25 22:31:05,872 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-11-25 22:31:08,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:31:10,472 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-11-25 22:31:12,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 [0, 1] [2022-11-25 22:31:15,709 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-11-25 22:31:15,853 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_723 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_720)))) (forall ((v_ArrVal_720 Int) (v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_723 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_720)) |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse5 .cse1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_723) .cse2) 2147483647) (not (<= v_ArrVal_720 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))))) is different from false [2022-11-25 22:31:18,113 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-11-25 22:31:21,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:31:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:31:21,558 INFO L93 Difference]: Finished difference Result 1637 states and 3987 transitions. [2022-11-25 22:31:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 22:31:21,559 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:31:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:31:21,566 INFO L225 Difference]: With dead ends: 1637 [2022-11-25 22:31:21,566 INFO L226 Difference]: Without dead ends: 1637 [2022-11-25 22:31:21,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=414, Invalid=1151, Unknown=23, NotChecked=574, Total=2162 [2022-11-25 22:31:21,568 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 413 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 30 mSolverCounterUnsat, 136 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 136 IncrementalHoareTripleChecker+Unknown, 991 IncrementalHoareTripleChecker+Unchecked, 78.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:31:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 200 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1195 Invalid, 136 Unknown, 991 Unchecked, 78.6s Time] [2022-11-25 22:31:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2022-11-25 22:31:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1024. [2022-11-25 22:31:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1006 states have (on average 2.55168986083499) internal successors, (2567), 1023 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2567 transitions. [2022-11-25 22:31:21,601 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2567 transitions. Word has length 17 [2022-11-25 22:31:21,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:31:21,601 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 2567 transitions. [2022-11-25 22:31:21,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2567 transitions. [2022-11-25 22:31:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:31:21,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:31:21,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:31:21,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:31:21,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 22:31:21,809 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:31:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:31:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643677, now seen corresponding path program 1 times [2022-11-25 22:31:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:31:21,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697156035] [2022-11-25 22:31:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:31:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:31:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:31:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:31:23,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:31:23,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697156035] [2022-11-25 22:31:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697156035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:31:23,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867212744] [2022-11-25 22:31:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:31:23,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:31:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:31:23,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:31:23,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:31:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:31:23,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-25 22:31:23,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:31:23,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:23,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:23,289 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:31:23,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:31:23,305 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:31:23,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:31:23,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-11-25 22:31:23,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:31:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:23,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:31:23,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 22:31:23,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:23,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:31:23,914 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:31:23,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 22:31:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:31:23,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:31:24,196 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_822 (Array Int Int)) (v_ArrVal_824 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_822) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_824) (+ 88 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_824 2147483648) 0))) is different from false [2022-11-25 22:31:24,608 INFO L321 Elim1Store]: treesize reduction 36, result has 59.6 percent of original size [2022-11-25 22:31:24,608 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 3 case distinctions, treesize of input 87 treesize of output 74 [2022-11-25 22:31:24,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:31:24,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 104 [2022-11-25 22:31:24,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 22:31:24,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:31:24,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:31:24,742 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 53 treesize of output 53 [2022-11-25 22:31:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:31:24,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867212744] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:31:24,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651283845] [2022-11-25 22:31:24,988 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-11-25 22:31:24,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:31:24,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-11-25 22:31:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027289195] [2022-11-25 22:31:24,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:31:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 22:31:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:31:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 22:31:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=635, Unknown=6, NotChecked=52, Total=812 [2022-11-25 22:31:24,993 INFO L87 Difference]: Start difference. First operand 1024 states and 2567 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:31:27,151 INFO L93 Difference]: Finished difference Result 1358 states and 3333 transitions. [2022-11-25 22:31:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:31:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:31:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:31:27,156 INFO L225 Difference]: With dead ends: 1358 [2022-11-25 22:31:27,156 INFO L226 Difference]: Without dead ends: 1358 [2022-11-25 22:31:27,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=344, Invalid=1136, Unknown=6, NotChecked=74, Total=1560 [2022-11-25 22:31:27,157 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 587 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:31:27,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 111 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 949 Invalid, 0 Unknown, 128 Unchecked, 1.2s Time] [2022-11-25 22:31:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-11-25 22:31:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 851. [2022-11-25 22:31:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 835 states have (on average 2.4778443113772455) internal successors, (2069), 850 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 2069 transitions. [2022-11-25 22:31:27,184 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 2069 transitions. Word has length 17 [2022-11-25 22:31:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:31:27,184 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 2069 transitions. [2022-11-25 22:31:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 2069 transitions. [2022-11-25 22:31:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:31:27,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:31:27,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:31:27,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 22:31:27,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 22:31:27,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:31:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:31:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113846, now seen corresponding path program 3 times [2022-11-25 22:31:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:31:27,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631984954] [2022-11-25 22:31:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:31:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:31:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:31:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:31:29,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:31:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631984954] [2022-11-25 22:31:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631984954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:31:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145349861] [2022-11-25 22:31:29,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:31:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:31:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:31:29,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:31:29,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 22:31:29,445 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:31:29,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:31:29,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 22:31:29,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:31:29,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:29,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:29,490 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:31:29,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:31:29,523 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:31:29,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:31:29,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:31:29,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 22:31:30,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 22:31:30,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 22:31:30,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:31:30,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 22:31:30,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 22:31:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:31:30,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:31:30,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-25 22:31:32,064 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_920) .cse1 v_ArrVal_922)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_920 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_922) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 22:31:32,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_924 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_920) .cse1 v_ArrVal_922)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_922) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_920) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 22:31:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:31:43,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145349861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:31:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [263609044] [2022-11-25 22:31:43,214 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-11-25 22:31:43,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:31:43,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 22:31:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340817110] [2022-11-25 22:31:43,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:31:43,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 22:31:43,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:31:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 22:31:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=754, Unknown=25, NotChecked=186, Total=1190 [2022-11-25 22:31:43,218 INFO L87 Difference]: Start difference. First operand 851 states and 2069 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:31:45,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:31:47,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_924 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_922 Int)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_922)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_922) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) .cse3) 2147483647)))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_924 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse7 v_ArrVal_920) .cse5 v_ArrVal_922)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_922) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse6 .cse2))) (< (+ (select .cse4 .cse7) 1) v_ArrVal_920) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) .cse3) 2147483647)))) (not (= |c_~#queue~0.base| 4)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_924 (Array Int Int)) (v_ArrVal_918 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_918))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_920) .cse2 v_ArrVal_922)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< (+ (select .cse8 .cse2) 1) v_ArrVal_922) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse9 .cse2))) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) .cse3) 2147483647) (< (+ (select .cse8 .cse3) 1) v_ArrVal_920) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse10 .cse2))))))) (exists ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_918 Int) (v_ArrVal_927 Int) (v_ArrVal_922 Int) (v_ArrVal_920 Int)) (let ((.cse11 (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse5 0) .cse7 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_918))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 0) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| v_ArrVal_922) (= .cse4 (store (store (store .cse11 .cse7 v_ArrVal_920) .cse5 v_ArrVal_922) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_927)) (<= v_ArrVal_920 (+ (select .cse11 .cse7) 1)) (<= v_ArrVal_922 (+ (select .cse11 .cse5) 1))))) (let ((.cse12 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not .cse12) (<= (* (select .cse10 84) 4) 4) (<= (select .cse10 88) 1)) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) (<= (select .cse13 88) 1) .cse12 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 88)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|)) (<= (* (select .cse13 84) 4) 4))))) (forall ((v_ArrVal_924 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_927 Int)) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_924) |c_~#stored_elements~0.base| v_ArrVal_925) |c_~#queue~0.base|))) (or (< (select (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| 4) |c_~#queue~0.offset|) v_ArrVal_927) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_158| (select .cse14 .cse2)))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) is different from false [2022-11-25 22:31:49,861 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-11-25 22:31:52,454 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-11-25 22:31:54,463 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-11-25 22:31:55,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:31:58,682 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-11-25 22:32:01,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:32:04,177 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-11-25 22:32:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:32:06,361 INFO L93 Difference]: Finished difference Result 1510 states and 3629 transitions. [2022-11-25 22:32:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 22:32:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:32:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:32:06,366 INFO L225 Difference]: With dead ends: 1510 [2022-11-25 22:32:06,366 INFO L226 Difference]: Without dead ends: 1510 [2022-11-25 22:32:06,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=491, Invalid=1472, Unknown=33, NotChecked=356, Total=2352 [2022-11-25 22:32:06,368 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 353 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 38 mSolverCounterUnsat, 160 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 160 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:32:06,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 185 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1316 Invalid, 160 Unknown, 401 Unchecked, 20.7s Time] [2022-11-25 22:32:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-11-25 22:32:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 874. [2022-11-25 22:32:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 858 states have (on average 2.491841491841492) internal successors, (2138), 873 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 2138 transitions. [2022-11-25 22:32:06,393 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 2138 transitions. Word has length 17 [2022-11-25 22:32:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:32:06,393 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 2138 transitions. [2022-11-25 22:32:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 2138 transitions. [2022-11-25 22:32:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:32:06,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:32:06,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:32:06,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 22:32:06,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 22:32:06,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:32:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:32:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 872614216, now seen corresponding path program 4 times [2022-11-25 22:32:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:32:06,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73943393] [2022-11-25 22:32:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:32:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:07,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:32:07,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73943393] [2022-11-25 22:32:07,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73943393] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:07,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258816780] [2022-11-25 22:32:07,838 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 22:32:07,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:07,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:32:07,839 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:32:07,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:32:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:08,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 22:32:08,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:08,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:08,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:08,046 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:32:08,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:32:08,069 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:32:08,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:32:08,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:32:08,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 22:32:08,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 22:32:08,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:08,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 22:32:09,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 22:32:11,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-25 22:32:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:11,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:11,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1028 Int) (v_ArrVal_1030 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1027))) (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_163| 4) |c_~#queue~0.offset|) v_ArrVal_1028)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1030) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| (select .cse1 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-25 22:32:11,649 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1030 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1026)) |c_~#stored_elements~0.base| v_ArrVal_1027))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 4) |c_~#queue~0.offset|) v_ArrVal_1028)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1030) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1026 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))) is different from false [2022-11-25 22:32:11,673 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1030 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1026)) |c_~#stored_elements~0.base| v_ArrVal_1027))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1026) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 4) |c_~#queue~0.offset|) v_ArrVal_1028)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1030) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 22:32:11,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1030 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1024) .cse3 v_ArrVal_1026)) |c_~#stored_elements~0.base| v_ArrVal_1027))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 4) |c_~#queue~0.offset|) v_ArrVal_1028)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1030) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1024 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1026)))))) is different from false [2022-11-25 22:32:12,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1024 Int) (v_ArrVal_1026 Int) (v_ArrVal_1028 Int) (v_ArrVal_1030 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 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_1021)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1024) .cse4 v_ArrVal_1026)) |c_~#stored_elements~0.base| v_ArrVal_1027))) (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_163| 4) |c_~#queue~0.offset|) v_ArrVal_1028)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1030) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1024) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1026)))))) is different from false [2022-11-25 22:32:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:32:16,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258816780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:32:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2128038220] [2022-11-25 22:32:16,432 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-11-25 22:32:16,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:32:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-25 22:32:16,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992731951] [2022-11-25 22:32:16,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:32:16,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 22:32:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:32:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 22:32:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=688, Unknown=13, NotChecked=300, Total=1190 [2022-11-25 22:32:16,436 INFO L87 Difference]: Start difference. First operand 874 states and 2138 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:37,594 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 138 DAG size of output: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:32:39,798 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-11-25 22:32:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:32:41,649 INFO L93 Difference]: Finished difference Result 1554 states and 3791 transitions. [2022-11-25 22:32:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:32:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 22:32:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:32:41,656 INFO L225 Difference]: With dead ends: 1554 [2022-11-25 22:32:41,656 INFO L226 Difference]: Without dead ends: 1554 [2022-11-25 22:32:41,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=498, Invalid=1487, Unknown=15, NotChecked=450, Total=2450 [2022-11-25 22:32:41,658 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 667 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 81 mSolverCounterUnsat, 85 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 85 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:32:41,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 159 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1066 Invalid, 85 Unknown, 490 Unchecked, 5.3s Time] [2022-11-25 22:32:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2022-11-25 22:32:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 873. [2022-11-25 22:32:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 857 states have (on average 2.541423570595099) internal successors, (2178), 872 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2178 transitions. [2022-11-25 22:32:41,688 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2178 transitions. Word has length 17 [2022-11-25 22:32:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:32:41,688 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 2178 transitions. [2022-11-25 22:32:41,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2178 transitions. [2022-11-25 22:32:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:32:41,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:32:41,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:32:41,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 22:32:41,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 22:32:41,896 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:32:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:32:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1057914270, now seen corresponding path program 1 times [2022-11-25 22:32:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:32:41,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52285000] [2022-11-25 22:32:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:32:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:42,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:32:42,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52285000] [2022-11-25 22:32:42,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52285000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:42,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478116268] [2022-11-25 22:32:42,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:42,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:42,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:32:42,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:32:42,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 22:32:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 22:32:42,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:42,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:42,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:42,738 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:32:42,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-11-25 22:32:42,759 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:32:42,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 22:32:42,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:32:43,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 22:32:43,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 22:32:43,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:43,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 22:32:43,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-25 22:32:43,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-25 22:32:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:43,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:43,890 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1130) .cse1)))))) is different from false [2022-11-25 22:32:43,920 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1124 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1124) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1130) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse0 .cse1)))))) is different from false [2022-11-25 22:32:43,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1128 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1122 Int) (v_ArrVal_1124 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1122)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1124) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1128) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_~#queue~0.offset|) v_ArrVal_1130) .cse1)))))) is different from false [2022-11-25 22:32:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 22:32:44,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478116268] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:32:44,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549136134] [2022-11-25 22:32:44,149 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 22:32:44,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:32:44,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-11-25 22:32:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227514729] [2022-11-25 22:32:44,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:32:44,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 22:32:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:32:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 22:32:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=392, Unknown=8, NotChecked=132, Total=650 [2022-11-25 22:32:44,151 INFO L87 Difference]: Start difference. First operand 873 states and 2178 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:49,923 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 [0, 1] [2022-11-25 22:32:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:32:54,855 INFO L93 Difference]: Finished difference Result 2096 states and 5101 transitions. [2022-11-25 22:32:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 22:32:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 22:32:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:32:54,863 INFO L225 Difference]: With dead ends: 2096 [2022-11-25 22:32:54,863 INFO L226 Difference]: Without dead ends: 2096 [2022-11-25 22:32:54,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=372, Invalid=1036, Unknown=10, NotChecked=222, Total=1640 [2022-11-25 22:32:54,865 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 476 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 70 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 501 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:32:54,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 178 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1439 Invalid, 38 Unknown, 501 Unchecked, 5.9s Time] [2022-11-25 22:32:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2022-11-25 22:32:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1439. [2022-11-25 22:32:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1423 states have (on average 2.599437807449051) internal successors, (3699), 1438 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 3699 transitions. [2022-11-25 22:32:54,910 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 3699 transitions. Word has length 19 [2022-11-25 22:32:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:32:54,911 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 3699 transitions. [2022-11-25 22:32:54,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:32:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 3699 transitions. [2022-11-25 22:32:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:32:54,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:32:54,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:32:54,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:32:55,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:55,123 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:32:55,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:32:55,124 INFO L85 PathProgramCache]: Analyzing trace with hash 31655794, now seen corresponding path program 1 times [2022-11-25 22:32:55,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:32:55,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661465027] [2022-11-25 22:32:55,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:55,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:32:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:56,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:32:56,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661465027] [2022-11-25 22:32:56,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661465027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:32:56,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823258008] [2022-11-25 22:32:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:32:56,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:32:56,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:32:56,359 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:32:56,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 22:32:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:32:56,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 22:32:56,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:32:56,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-25 22:32:56,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:56,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:56,629 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:32:56,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-25 22:32:56,663 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:32:56,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:32:56,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:32:56,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:32:56,864 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-25 22:32:56,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-25 22:32:56,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:56,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:32:57,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-25 22:32:57,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:32:57,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:32:57,220 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-25 22:32:57,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-25 22:32:57,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:32:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:32:57,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:32:57,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1234)) .cse1)) 2147483647)) is different from false [2022-11-25 22:32:57,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1234)) .cse1)) 2147483647)) is different from false [2022-11-25 22:32:57,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1234)) .cse2)) 2147483647))))) is different from false [2022-11-25 22:32:57,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1230 Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1230) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1234)) .cse2)) 2147483647))))) is different from false [2022-11-25 22:32:57,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1228 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_1228)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= 20 .cse0) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1230) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1234)) .cse2)) 2147483647))))) is different from false [2022-11-25 22:32:57,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1230 Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1228 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1226))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1228)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1230) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1233) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1234)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse5 .cse2))))))))) is different from false [2022-11-25 22:32:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 22:32:57,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823258008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:32:57,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [390376055] [2022-11-25 22:32:57,760 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-11-25 22:32:57,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:32:57,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2022-11-25 22:32:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471971884] [2022-11-25 22:32:57,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:32:57,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 22:32:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:32:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 22:32:57,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=446, Unknown=9, NotChecked=306, Total=930 [2022-11-25 22:32:57,765 INFO L87 Difference]: Start difference. First operand 1439 states and 3699 transitions. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:00,232 INFO L93 Difference]: Finished difference Result 2216 states and 5509 transitions. [2022-11-25 22:33:00,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:33:00,233 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:33:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:00,240 INFO L225 Difference]: With dead ends: 2216 [2022-11-25 22:33:00,240 INFO L226 Difference]: Without dead ends: 2216 [2022-11-25 22:33:00,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=357, Invalid=917, Unknown=10, NotChecked=438, Total=1722 [2022-11-25 22:33:00,241 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 362 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 46 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 693 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:00,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 126 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 890 Invalid, 17 Unknown, 693 Unchecked, 1.4s Time] [2022-11-25 22:33:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-11-25 22:33:00,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1636. [2022-11-25 22:33:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1620 states have (on average 2.575925925925926) internal successors, (4173), 1635 states have internal predecessors, (4173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4173 transitions. [2022-11-25 22:33:00,285 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4173 transitions. Word has length 20 [2022-11-25 22:33:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:00,285 INFO L495 AbstractCegarLoop]: Abstraction has 1636 states and 4173 transitions. [2022-11-25 22:33:00,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4173 transitions. [2022-11-25 22:33:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:33:00,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:00,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:00,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-25 22:33:00,494 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:33:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1999023912, now seen corresponding path program 1 times [2022-11-25 22:33:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:00,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363412499] [2022-11-25 22:33:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:01,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:01,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363412499] [2022-11-25 22:33:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363412499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:01,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517245670] [2022-11-25 22:33:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:01,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:01,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 22:33:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:01,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 22:33:01,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:01,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:01,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:01,619 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:33:01,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:33:01,651 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:33:01,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:33:01,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:33:01,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 22:33:02,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 22:33:02,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 22:33:02,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:02,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 22:33:02,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-25 22:33:02,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-25 22:33:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:02,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:02,949 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1) 2147483650))))) is different from false [2022-11-25 22:33:02,964 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1341 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1341) |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1)))))) is different from false [2022-11-25 22:33:02,979 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1341 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1341) |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1)))))) is different from false [2022-11-25 22:33:02,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1341 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1341) |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1) 2147483650))))) is different from false [2022-11-25 22:33:03,144 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1336 Int) (v_ArrVal_1341 (Array Int Int)) (v_ArrVal_1337 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1336)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1337) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1341) |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1)))))) is different from false [2022-11-25 22:33:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 22:33:03,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517245670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:03,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1899305663] [2022-11-25 22:33:03,350 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 22:33:03,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:03,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-11-25 22:33:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274347717] [2022-11-25 22:33:03,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:03,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 22:33:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:03,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 22:33:03,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=525, Unknown=7, NotChecked=260, Total=930 [2022-11-25 22:33:03,354 INFO L87 Difference]: Start difference. First operand 1636 states and 4173 transitions. Second operand has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:06,593 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (< 0 (+ 2147483650 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1344 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse0 .cse1)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1344 Int) (v_ArrVal_1341 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1341) |c_~#stored_elements~0.base| v_ArrVal_1342) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| (select .cse2 .cse1))) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_178| 4)) v_ArrVal_1344) .cse1)))))))) is different from false [2022-11-25 22:33:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:08,092 INFO L93 Difference]: Finished difference Result 2823 states and 6874 transitions. [2022-11-25 22:33:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:33:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:33:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:08,099 INFO L225 Difference]: With dead ends: 2823 [2022-11-25 22:33:08,100 INFO L226 Difference]: Without dead ends: 2823 [2022-11-25 22:33:08,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=272, Invalid=996, Unknown=16, NotChecked=438, Total=1722 [2022-11-25 22:33:08,101 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 415 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 46 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:08,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 168 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1319 Invalid, 19 Unknown, 631 Unchecked, 3.0s Time] [2022-11-25 22:33:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-11-25 22:33:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1678. [2022-11-25 22:33:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1662 states have (on average 2.5523465703971118) internal successors, (4242), 1677 states have internal predecessors, (4242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4242 transitions. [2022-11-25 22:33:08,153 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4242 transitions. Word has length 20 [2022-11-25 22:33:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:08,153 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 4242 transitions. [2022-11-25 22:33:08,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4242 transitions. [2022-11-25 22:33:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:33:08,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:08,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:08,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-25 22:33:08,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:08,368 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:33:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1562495948, now seen corresponding path program 2 times [2022-11-25 22:33:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:08,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939303082] [2022-11-25 22:33:08,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:09,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:09,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939303082] [2022-11-25 22:33:09,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939303082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490180292] [2022-11-25 22:33:09,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:33:09,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:09,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:09,082 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:09,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 22:33:09,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 22:33:09,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:09,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-25 22:33:09,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:09,352 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:33:09,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:33:09,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:33:09,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:09,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:33:09,745 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 22:33:09,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 22:33:09,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:33:09,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 22:33:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:09,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:09,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 Int)) (or (not (<= |c_t1Thread1of1ForFork1_enqueue_~x#1| v_ArrVal_1435)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1435)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1436) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483650)))) is different from false [2022-11-25 22:33:09,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1435 Int)) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1435)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1436) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_1435 2147483648) 0))) is different from false [2022-11-25 22:33:10,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1436 (Array Int Int)) (v_ArrVal_1433 (Array Int Int)) (v_ArrVal_1435 Int)) (or (< 0 (+ 2147483650 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1433))) (store .cse0 |c_~#queue~0.base| (store (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1435))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1436) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_1435 2147483648) 0))) is different from false [2022-11-25 22:33:10,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:10,029 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 52 treesize of output 43 [2022-11-25 22:33:10,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:10,045 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 93 treesize of output 97 [2022-11-25 22:33:10,055 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 51 treesize of output 47 [2022-11-25 22:33:10,062 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 88 treesize of output 80 [2022-11-25 22:33:10,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 22:33:10,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:33:10,138 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 51 treesize of output 51 [2022-11-25 22:33:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:33:10,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490180292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:10,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406093386] [2022-11-25 22:33:10,343 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-11-25 22:33:10,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:10,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-25 22:33:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847593654] [2022-11-25 22:33:10,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:10,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 22:33:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 22:33:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=315, Unknown=7, NotChecked=114, Total=506 [2022-11-25 22:33:10,345 INFO L87 Difference]: Start difference. First operand 1678 states and 4242 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:10,942 INFO L93 Difference]: Finished difference Result 1763 states and 4409 transitions. [2022-11-25 22:33:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:33:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:33:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:10,945 INFO L225 Difference]: With dead ends: 1763 [2022-11-25 22:33:10,945 INFO L226 Difference]: Without dead ends: 1763 [2022-11-25 22:33:10,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=402, Unknown=7, NotChecked=132, Total=650 [2022-11-25 22:33:10,946 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 471 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:10,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 28 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 297 Invalid, 0 Unknown, 168 Unchecked, 0.4s Time] [2022-11-25 22:33:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-11-25 22:33:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1556. [2022-11-25 22:33:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1542 states have (on average 2.519455252918288) internal successors, (3885), 1555 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 3885 transitions. [2022-11-25 22:33:10,988 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 3885 transitions. Word has length 20 [2022-11-25 22:33:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:10,989 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 3885 transitions. [2022-11-25 22:33:10,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 3885 transitions. [2022-11-25 22:33:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:33:10,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:10,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:11,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:11,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:11,200 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:33:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1562495934, now seen corresponding path program 2 times [2022-11-25 22:33:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:11,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300861466] [2022-11-25 22:33:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:12,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300861466] [2022-11-25 22:33:12,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300861466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:12,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930793831] [2022-11-25 22:33:12,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:33:12,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:12,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:12,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 22:33:12,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 22:33:12,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:12,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-25 22:33:12,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:12,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:12,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:12,432 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:33:12,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:33:12,459 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:33:12,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:33:12,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-25 22:33:12,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-25 22:33:12,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-25 22:33:13,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:13,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-25 22:33:13,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-11-25 22:33:13,215 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 46 treesize of output 48 [2022-11-25 22:33:13,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-11-25 22:33:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:13,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:14,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (let ((.cse4 (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_1536)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1538) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse3)) 2147483647))))) is different from false [2022-11-25 22:33:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 22:33:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930793831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [760972008] [2022-11-25 22:33:14,450 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-11-25 22:33:14,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:14,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 30 [2022-11-25 22:33:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815951428] [2022-11-25 22:33:14,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 22:33:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 22:33:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=685, Unknown=34, NotChecked=58, Total=992 [2022-11-25 22:33:14,453 INFO L87 Difference]: Start difference. First operand 1556 states and 3885 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:16,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (let ((.cse0 (select .cse4 .cse5))) (or (= .cse0 20) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse3)) 2147483647)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (exists ((v_ArrVal_1544 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (= (store (store (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse5 0) .cse6 0) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| v_ArrVal_1536) .cse6 v_ArrVal_1538)) .cse5 1) (+ 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1544) .cse4)))) is different from false [2022-11-25 22:33:19,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:33:19,410 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1544))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse1) 2147483647)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse1) 2147483647)) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (exists ((v_ArrVal_1544 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (= (store (store (let ((.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse5 0) .cse6 0) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| v_ArrVal_1536) .cse6 v_ArrVal_1538)) .cse5 1) (+ 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1544) .cse4)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2022-11-25 22:33:20,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1544))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse1) 2147483647)) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (exists ((v_ArrVal_1544 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (= (store (store (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse2 0) .cse3 0) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| v_ArrVal_1536) .cse3 v_ArrVal_1538)) .cse2 1) (+ 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1544) .cse4)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse2 (+ (select .cse4 .cse2) 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2022-11-25 22:33:21,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (exists ((v_ArrVal_1544 Int) (v_ArrVal_1536 Int) (v_ArrVal_1538 Int)) (= (store (store (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store (store (store (store ((as const (Array Int Int)) 0) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 80) 0) .cse0 0) .cse1 0) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| v_ArrVal_1536) .cse1 v_ArrVal_1538)) .cse0 1) (+ 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1544) .cse2)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse0 (+ (select .cse2 .cse0) 1))) |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse5) 2147483647)) (forall ((v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 (Array Int Int)) (v_ArrVal_1544 Int)) (< (select (select (store (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1542))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_1544)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#queue~0.base|) .cse5) 2147483647)))) is different from false [2022-11-25 22:33:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:33:24,270 INFO L93 Difference]: Finished difference Result 2649 states and 6554 transitions. [2022-11-25 22:33:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 22:33:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:33:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:33:24,276 INFO L225 Difference]: With dead ends: 2649 [2022-11-25 22:33:24,276 INFO L226 Difference]: Without dead ends: 2649 [2022-11-25 22:33:24,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=339, Invalid=1030, Unknown=57, NotChecked=380, Total=1806 [2022-11-25 22:33:24,278 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 491 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 70 mSolverCounterUnsat, 184 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 184 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:33:24,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 176 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1352 Invalid, 184 Unknown, 298 Unchecked, 8.4s Time] [2022-11-25 22:33:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2022-11-25 22:33:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1662. [2022-11-25 22:33:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1648 states have (on average 2.5242718446601944) internal successors, (4160), 1661 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 4160 transitions. [2022-11-25 22:33:24,353 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 4160 transitions. Word has length 20 [2022-11-25 22:33:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:33:24,353 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 4160 transitions. [2022-11-25 22:33:24,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 4160 transitions. [2022-11-25 22:33:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:33:24,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:33:24,355 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:33:24,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 22:33:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 22:33:24,562 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:33:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:33:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1564394064, now seen corresponding path program 3 times [2022-11-25 22:33:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:33:24,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669005749] [2022-11-25 22:33:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:33:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:33:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:33:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:25,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:33:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669005749] [2022-11-25 22:33:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669005749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:33:25,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370967431] [2022-11-25 22:33:25,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:33:25,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:33:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:33:25,407 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:33:25,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 22:33:25,598 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:33:25,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:33:25,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-25 22:33:25,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:33:25,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:25,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:25,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:33:25,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:33:25,664 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:33:25,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:33:25,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:33:25,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 22:33:26,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 22:33:26,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:33:26,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 74 treesize of output 76 [2022-11-25 22:33:26,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-25 22:33:26,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 22:33:26,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-25 22:33:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:33:26,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:33:26,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 22:33:27,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-25 22:33:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:33:28,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370967431] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:33:28,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [689262588] [2022-11-25 22:33:28,051 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-11-25 22:33:28,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:33:28,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 31 [2022-11-25 22:33:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140713375] [2022-11-25 22:33:28,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:33:28,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 22:33:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:33:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 22:33:28,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=751, Unknown=34, NotChecked=118, Total=1056 [2022-11-25 22:33:28,055 INFO L87 Difference]: Start difference. First operand 1662 states and 4160 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:33:41,274 WARN L233 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 164 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:33:42,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:33:45,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select .cse0 .cse3)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse12 (select .cse10 .cse11))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 0) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1652 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ (* .cse1 4) |c_~#queue~0.offset|) v_ArrVal_1652) .cse2 v_ArrVal_1653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse3) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int) (v_ArrVal_1644 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| Int) (v_ArrVal_1646 Int)) (let ((.cse7 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| 4)) v_ArrVal_1644))) (let ((.cse4 (select .cse7 .cse3))) (or (= 20 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_193| .cse1)) (< (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_1646) .cse3 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) .cse2 v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse3) 2147483647))))) (= |c_~#queue~0.offset| 0) (or (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int) (v_ArrVal_1646 Int)) (< (select (select (store (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1646) .cse11 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse8 |c_~#queue~0.base| (store (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_1652)) .cse2 v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse3) 2147483647)) (= .cse12 20)) (not (= .cse11 0)) (<= .cse12 1) (<= (* (select .cse0 84) 4) 4) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse11)) (forall ((v_ArrVal_1655 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse11) 2147483647))))) is different from false [2022-11-25 22:33:47,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse7 .cse3)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1652 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) .cse2 v_ArrVal_1653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse1) 2147483647)) (not (= .cse3 0)) (<= .cse4 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse3)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse5 |c_~#queue~0.base| (store (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) .cse2 v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse1) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse3) 2147483647))))) is different from false [2022-11-25 22:33:47,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (and (or (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int) (v_ArrVal_1646 Int)) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1646) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1652)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse2)) 2147483647)) (= .cse5 20)) (not (= .cse4 0)) (<= .cse5 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse4))))) is different from false [2022-11-25 22:33:49,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse5 .cse0))) (and (not (= .cse0 0)) (<= .cse1 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse0)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse0 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse4)) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647))))) is different from false [2022-11-25 22:33:50,390 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5))) (and (or (= .cse0 20) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse1 |c_~#queue~0.base| (store (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse3)) 2147483647))) (not (= .cse5 0)) (<= .cse0 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse5))))) is different from false [2022-11-25 22:33:53,146 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse0 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse5 .cse0))) (and (not (= .cse0 0)) (<= .cse1 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| .cse0)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse0 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse2 |c_~#queue~0.base| (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) (+ 88 |c_~#queue~0.offset|) v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse4)) 2147483647))))) is different from false [2022-11-25 22:33:55,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1652 Int)) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1650))) (store .cse0 |c_~#queue~0.base| (store (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1652)) .cse3 v_ArrVal_1653))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1652 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1652)) .cse3 v_ArrVal_1653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1653 Int) (v_ArrVal_1652 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1652) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1653)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5) 2147483647)) (forall ((v_ArrVal_1655 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1655) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse5) 2147483647)))) is different from false [2022-11-25 22:34:03,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:03,129 INFO L93 Difference]: Finished difference Result 4237 states and 10351 transitions. [2022-11-25 22:34:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 22:34:03,129 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 22:34:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:03,137 INFO L225 Difference]: With dead ends: 4237 [2022-11-25 22:34:03,137 INFO L226 Difference]: Without dead ends: 4237 [2022-11-25 22:34:03,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=879, Invalid=3157, Unknown=160, NotChecked=1206, Total=5402 [2022-11-25 22:34:03,139 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1105 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 134 mSolverCounterUnsat, 257 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 257 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:03,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 224 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1732 Invalid, 257 Unknown, 768 Unchecked, 12.0s Time] [2022-11-25 22:34:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2022-11-25 22:34:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 1836. [2022-11-25 22:34:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1822 states have (on average 2.602085620197585) internal successors, (4741), 1835 states have internal predecessors, (4741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 4741 transitions. [2022-11-25 22:34:03,188 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 4741 transitions. Word has length 20 [2022-11-25 22:34:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:03,188 INFO L495 AbstractCegarLoop]: Abstraction has 1836 states and 4741 transitions. [2022-11-25 22:34:03,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 4741 transitions. [2022-11-25 22:34:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:34:03,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:03,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:03,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:03,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:34:03,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:34:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -148593879, now seen corresponding path program 1 times [2022-11-25 22:34:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978248453] [2022-11-25 22:34:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:03,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978248453] [2022-11-25 22:34:03,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978248453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:34:03,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66034078] [2022-11-25 22:34:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:34:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:34:03,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:34:03,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 22:34:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:03,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:34:03,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:34:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:03,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:34:03,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66034078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:03,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:34:03,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-11-25 22:34:03,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23752627] [2022-11-25 22:34:03,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:03,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:34:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:03,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:34:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:34:03,760 INFO L87 Difference]: Start difference. First operand 1836 states and 4741 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:03,907 INFO L93 Difference]: Finished difference Result 1824 states and 4631 transitions. [2022-11-25 22:34:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:34:03,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 22:34:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:03,910 INFO L225 Difference]: With dead ends: 1824 [2022-11-25 22:34:03,910 INFO L226 Difference]: Without dead ends: 1824 [2022-11-25 22:34:03,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 22:34:03,911 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:03,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 12 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2022-11-25 22:34:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2022-11-25 22:34:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1812 states have (on average 2.5557395143487858) internal successors, (4631), 1823 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4631 transitions. [2022-11-25 22:34:03,936 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4631 transitions. Word has length 22 [2022-11-25 22:34:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:03,937 INFO L495 AbstractCegarLoop]: Abstraction has 1824 states and 4631 transitions. [2022-11-25 22:34:03,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4631 transitions. [2022-11-25 22:34:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 22:34:03,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:03,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:03,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:04,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 22:34:04,146 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:34:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -148593699, now seen corresponding path program 1 times [2022-11-25 22:34:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:04,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702878916] [2022-11-25 22:34:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:34:04,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:04,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702878916] [2022-11-25 22:34:04,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702878916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:34:04,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:34:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:34:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371155305] [2022-11-25 22:34:04,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:34:04,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:34:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:34:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:34:04,209 INFO L87 Difference]: Start difference. First operand 1824 states and 4631 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:04,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:04,373 INFO L93 Difference]: Finished difference Result 1812 states and 4521 transitions. [2022-11-25 22:34:04,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:34:04,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 22:34:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:04,376 INFO L225 Difference]: With dead ends: 1812 [2022-11-25 22:34:04,376 INFO L226 Difference]: Without dead ends: 1812 [2022-11-25 22:34:04,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:34:04,377 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:04,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:34:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2022-11-25 22:34:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2022-11-25 22:34:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1802 states have (on average 2.5088790233074363) internal successors, (4521), 1811 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 4521 transitions. [2022-11-25 22:34:04,409 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 4521 transitions. Word has length 22 [2022-11-25 22:34:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:04,409 INFO L495 AbstractCegarLoop]: Abstraction has 1812 states and 4521 transitions. [2022-11-25 22:34:04,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 4521 transitions. [2022-11-25 22:34:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 22:34:04,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:04,412 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-11-25 22:34:04,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 22:34:04,413 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:34:04,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1098079562, now seen corresponding path program 1 times [2022-11-25 22:34:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:04,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556887475] [2022-11-25 22:34:04,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:04,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556887475] [2022-11-25 22:34:04,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556887475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:34:04,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93317875] [2022-11-25 22:34:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:04,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:34:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:34:04,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:34:04,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 22:34:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:04,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:34:04,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:34:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:04,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:34:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:04,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93317875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:34:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2129530520] [2022-11-25 22:34:04,845 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-11-25 22:34:04,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:34:04,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 22:34:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756838749] [2022-11-25 22:34:04,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:34:04,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 22:34:04,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 22:34:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:34:04,847 INFO L87 Difference]: Start difference. First operand 1812 states and 4521 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:34:05,171 INFO L93 Difference]: Finished difference Result 1926 states and 4733 transitions. [2022-11-25 22:34:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:34:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 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-11-25 22:34:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:34:05,174 INFO L225 Difference]: With dead ends: 1926 [2022-11-25 22:34:05,174 INFO L226 Difference]: Without dead ends: 1926 [2022-11-25 22:34:05,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:34:05,175 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:34:05,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 26 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:34:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-11-25 22:34:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1860. [2022-11-25 22:34:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1850 states have (on average 2.481081081081081) internal successors, (4590), 1859 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 4590 transitions. [2022-11-25 22:34:05,205 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 4590 transitions. Word has length 24 [2022-11-25 22:34:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:34:05,205 INFO L495 AbstractCegarLoop]: Abstraction has 1860 states and 4590 transitions. [2022-11-25 22:34:05,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 4590 transitions. [2022-11-25 22:34:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 22:34:05,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:34:05,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 22:34:05,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 22:34:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 22:34:05,416 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 22:34:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:34:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash 178452745, now seen corresponding path program 5 times [2022-11-25 22:34:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:34:05,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697868488] [2022-11-25 22:34:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:34:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:34:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:34:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:08,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:34:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697868488] [2022-11-25 22:34:08,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697868488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:34:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965007925] [2022-11-25 22:34:08,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:34:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:34:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:34:08,567 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:34:08,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d395d214-8e88-4052-ae8b-148faab0c5d5/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 22:34:09,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 22:34:09,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:34:09,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-25 22:34:09,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:34:09,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:34:09,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:34:09,138 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:34:09,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 22:34:09,161 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 22:34:09,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 22:34:09,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 22:34:09,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 22:34:09,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-11-25 22:34:09,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:34:09,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 22:34:10,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 22:34:10,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2022-11-25 22:34:10,720 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-11-25 22:34:12,105 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-11-25 22:34:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:34:12,655 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-11-25 22:34:14,136 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-11-25 22:34:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:34:17,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:34:17,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1985 Int) (v_ArrVal_1988 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_1985 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-25 22:34:17,664 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1982) .cse2 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1985) (not (<= v_ArrVal_1982 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-25 22:34:17,697 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1985) (not (<= v_ArrVal_1982 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 22:34:17,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_1985) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_1982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse3 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 22:34:17,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 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_1979))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse1 v_ArrVal_1982) .cse4 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1985) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-25 22:34:17,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_1985) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1982)))))))) is different from false [2022-11-25 22:34:17,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1988 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1985) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse5 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse3) 2147483647))))))))) is different from false [2022-11-25 22:34:17,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1977 Int) (v_ArrVal_1988 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1977)) |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1982) .cse2 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse3 .cse2))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1985) (not (<= v_ArrVal_1977 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1982))))))))) is different from false [2022-11-25 22:34:17,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int) (v_ArrVal_1977 Int) (v_ArrVal_1988 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1977)) |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1982) .cse2 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1977) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse5 .cse2))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_1985) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1982)))))))))) is different from false [2022-11-25 22:34:18,090 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1974 Int) (v_ArrVal_1985 Int) (v_ArrVal_1977 Int) (v_ArrVal_1988 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1974) .cse3 v_ArrVal_1977)) |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1985) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1977) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse7 .cse1))) (not (<= v_ArrVal_1974 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse6) 2147483647)))))))))) is different from false [2022-11-25 22:34:18,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1982 Int) (v_ArrVal_1974 Int) (v_ArrVal_1985 Int) (v_ArrVal_1977 Int) (v_ArrVal_1988 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1974) .cse4 v_ArrVal_1977)) |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_1982) .cse3 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1974) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1985) (< (+ (select .cse0 .cse4) 1) v_ArrVal_1977) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse5 .cse3))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1982) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse8 .cse3))) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse7) 2147483647)))))))))) is different from false [2022-11-25 22:34:18,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (v_ArrVal_1979 Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1981 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1972 Int) (v_ArrVal_1982 Int) (v_ArrVal_1974 Int) (v_ArrVal_1985 Int) (v_ArrVal_1977 Int) (v_ArrVal_1988 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_1972)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1974) .cse7 v_ArrVal_1977)) |c_~#stored_elements~0.base| v_ArrVal_1978))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1979))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1981))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_1982) .cse1 v_ArrVal_1985)) |c_~#stored_elements~0.base| v_ArrVal_1986) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1974) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1982) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_199| 4) |c_~#queue~0.offset|) v_ArrVal_1988) .cse5) 2147483647) (< (+ (select .cse6 .cse1) 1) v_ArrVal_1985) (< (+ (select .cse2 .cse7) 1) v_ArrVal_1977) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse8 .cse1)))))))))))) is different from false [2022-11-25 22:34:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-25 22:34:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965007925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:34:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1296009982] [2022-11-25 22:34:25,581 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-11-25 22:34:25,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:34:25,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-25 22:34:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070168344] [2022-11-25 22:34:25,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:34:25,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 22:34:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:34:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 22:34:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1351, Unknown=24, NotChecked=1092, Total=2862 [2022-11-25 22:34:25,585 INFO L87 Difference]: Start difference. First operand 1860 states and 4590 transitions. Second operand has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:34:51,069 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-11-25 22:35:16,204 WARN L233 SmtUtils]: Spent 24.35s on a formula simplification. DAG size of input: 169 DAG size of output: 159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:35:18,334 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-11-25 22:35:20,342 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-11-25 22:35:22,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:35:24,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:35:26,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:35:28,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:35:30,381 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-11-25 22:35:32,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, 1] [2022-11-25 22:35:34,394 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-11-25 22:35:36,401 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-11-25 22:35:38,408 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-11-25 22:36:07,485 WARN L233 SmtUtils]: Spent 16.28s on a formula simplification. DAG size of input: 137 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:36:09,604 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-11-25 22:36:11,612 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-11-25 22:36:13,623 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-11-25 22:36:15,638 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-11-25 22:36:17,651 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-11-25 22:36:19,664 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-11-25 22:36:21,670 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-11-25 22:36:23,682 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-11-25 22:36:25,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:36:27,703 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-11-25 22:36:29,712 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-11-25 22:36:31,725 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-11-25 22:36:34,528 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-11-25 22:36:36,539 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-11-25 22:36:38,545 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-11-25 22:36:47,063 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 168 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:36:56,692 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-11-25 22:36:58,785 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-11-25 22:37:15,532 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-11-25 22:37:17,542 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-11-25 22:37:19,549 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-11-25 22:37:21,556 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-11-25 22:37:23,564 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-11-25 22:37:25,571 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-11-25 22:37:27,577 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-11-25 22:37:29,585 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-11-25 22:37:31,591 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-11-25 22:37:33,598 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-11-25 22:37:35,604 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-11-25 22:37:56,102 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-11-25 22:38:12,736 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-11-25 22:38:32,553 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-11-25 22:38:35,515 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-11-25 22:38:38,971 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-11-25 22:38:41,139 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-11-25 22:38:46,630 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-11-25 22:38:48,654 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-11-25 22:38:50,679 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-11-25 22:38:52,723 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-11-25 22:38:54,762 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-11-25 22:38:56,801 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-11-25 22:38:58,834 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-11-25 22:39:08,774 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 150 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:39:10,789 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-11-25 22:39:12,804 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-11-25 22:39:14,821 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-11-25 22:39:16,836 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-11-25 22:39:19,179 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-11-25 22:39:21,188 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-11-25 22:39:22,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:39:24,408 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-11-25 22:39:26,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:39:28,486 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-11-25 22:39:30,504 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-11-25 22:39:33,147 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-11-25 22:40:00,860 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, 1] [2022-11-25 22:40:10,200 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-11-25 22:40:17,269 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-11-25 22:40:19,358 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-11-25 22:40:56,976 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-11-25 22:40:59,018 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-11-25 22:42:06,548 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-11-25 22:42:09,412 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-11-25 22:42:11,426 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-11-25 22:42:13,435 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-11-25 22:42:15,452 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]