./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:29:17,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:29:17,684 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 19:29:17,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:29:17,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:29:17,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:29:17,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:29:17,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:29:17,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:29:17,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:29:17,719 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:29:17,720 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:29:17,720 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:29:17,720 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:29:17,721 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:29:17,721 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:29:17,722 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:29:17,722 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:29:17,723 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:29:17,723 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:29:17,724 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:29:17,725 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:29:17,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:29:17,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:29:17,726 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:29:17,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:29:17,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:29:17,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:29:17,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:29:17,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:29:17,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:29:17,729 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 19:29:17,729 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 19:29:17,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:29:17,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:29:17,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:29:17,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:29:17,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:29:17,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:29:17,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:29:17,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:29:17,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:29:17,733 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:29:17,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:29:17,733 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/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_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-12-02 19:29:17,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:29:17,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:29:17,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:29:17,983 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:29:17,983 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:29:17,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread/queue_ok.i [2023-12-02 19:29:20,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:29:20,982 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:29:20,983 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/sv-benchmarks/c/pthread/queue_ok.i [2023-12-02 19:29:21,001 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/data/8529f81b7/c32d5c151dbc4086a0c732cdf525fd70/FLAGad1dd8149 [2023-12-02 19:29:21,014 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/data/8529f81b7/c32d5c151dbc4086a0c732cdf525fd70 [2023-12-02 19:29:21,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:29:21,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:29:21,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:29:21,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:29:21,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:29:21,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6853fd48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21, skipping insertion in model container [2023-12-02 19:29:21,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,077 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:29:21,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:29:21,445 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:29:21,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:29:21,553 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:29:21,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21 WrapperNode [2023-12-02 19:29:21,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:29:21,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:29:21,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:29:21,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:29:21,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,611 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 226 [2023-12-02 19:29:21,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:29:21,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:29:21,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:29:21,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:29:21,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:29:21,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:29:21,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:29:21,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:29:21,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (1/1) ... [2023-12-02 19:29:21,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:29:21,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:21,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:29:21,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:29:21,724 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 19:29:21,725 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 19:29:21,725 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 19:29:21,725 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 19:29:21,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 19:29:21,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 19:29:21,725 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:29:21,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:29:21,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:29:21,728 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 19:29:21,878 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:29:21,880 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:29:22,186 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:29:22,423 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:29:22,423 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 19:29:22,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:29:22 BoogieIcfgContainer [2023-12-02 19:29:22,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:29:22,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:29:22,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:29:22,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:29:22,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:29:21" (1/3) ... [2023-12-02 19:29:22,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53de98a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:29:22, skipping insertion in model container [2023-12-02 19:29:22,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:29:21" (2/3) ... [2023-12-02 19:29:22,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53de98a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:29:22, skipping insertion in model container [2023-12-02 19:29:22,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:29:22" (3/3) ... [2023-12-02 19:29:22,432 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-12-02 19:29:22,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 19:29:22,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:29:22,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-12-02 19:29:22,452 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 19:29:22,514 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 19:29:22,543 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 62 transitions, 138 flow [2023-12-02 19:29:22,622 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:22,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:29:22,646 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=LoopHeads, 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;@7a5fe4c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:29:22,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-12-02 19:29:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 19:29:22,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:22,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:22,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:22,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1388236445, now seen corresponding path program 1 times [2023-12-02 19:29:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020669713] [2023-12-02 19:29:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:23,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020669713] [2023-12-02 19:29:23,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020669713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:23,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:23,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:29:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528021465] [2023-12-02 19:29:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:23,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:29:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:29:23,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:29:23,453 INFO L87 Difference]: Start difference. First operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 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 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:23,664 INFO L93 Difference]: Finished difference Result 1230 states and 3261 transitions. [2023-12-02 19:29:23,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:29:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 19:29:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:23,690 INFO L225 Difference]: With dead ends: 1230 [2023-12-02 19:29:23,690 INFO L226 Difference]: Without dead ends: 1230 [2023-12-02 19:29:23,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:29:23,695 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:23,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:23,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-12-02 19:29:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2023-12-02 19:29:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1179 states have (on average 2.761662425784563) internal successors, (3256), 1226 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3256 transitions. [2023-12-02 19:29:23,803 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3256 transitions. Word has length 8 [2023-12-02 19:29:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:23,804 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 3256 transitions. [2023-12-02 19:29:23,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3256 transitions. [2023-12-02 19:29:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:29:23,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:23,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:23,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:29:23,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:23,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1089532431, now seen corresponding path program 1 times [2023-12-02 19:29:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271814548] [2023-12-02 19:29:23,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:24,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271814548] [2023-12-02 19:29:24,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271814548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:29:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391227121] [2023-12-02 19:29:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:29:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:29:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:29:24,172 INFO L87 Difference]: Start difference. First operand 1227 states and 3256 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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) [2023-12-02 19:29:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:24,368 INFO L93 Difference]: Finished difference Result 1712 states and 4510 transitions. [2023-12-02 19:29:24,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:29:24,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 [2023-12-02 19:29:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:24,383 INFO L225 Difference]: With dead ends: 1712 [2023-12-02 19:29:24,383 INFO L226 Difference]: Without dead ends: 1712 [2023-12-02 19:29:24,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:29:24,385 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:24,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 87 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:29:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-02 19:29:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1376. [2023-12-02 19:29:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1328 states have (on average 2.7808734939759034) internal successors, (3693), 1375 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3693 transitions. [2023-12-02 19:29:24,466 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3693 transitions. Word has length 9 [2023-12-02 19:29:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:24,466 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 3693 transitions. [2023-12-02 19:29:24,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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) [2023-12-02 19:29:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3693 transitions. [2023-12-02 19:29:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:29:24,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:24,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:24,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 19:29:24,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:24,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1691643503, now seen corresponding path program 1 times [2023-12-02 19:29:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617905696] [2023-12-02 19:29:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:24,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617905696] [2023-12-02 19:29:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617905696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 19:29:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179737356] [2023-12-02 19:29:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:24,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:29:24,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:29:24,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:29:24,557 INFO L87 Difference]: Start difference. First operand 1376 states and 3693 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) [2023-12-02 19:29:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:24,628 INFO L93 Difference]: Finished difference Result 566 states and 1315 transitions. [2023-12-02 19:29:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:29:24,628 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 [2023-12-02 19:29:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:24,633 INFO L225 Difference]: With dead ends: 566 [2023-12-02 19:29:24,633 INFO L226 Difference]: Without dead ends: 528 [2023-12-02 19:29:24,634 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 [2023-12-02 19:29:24,635 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:24,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-02 19:29:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2023-12-02 19:29:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 516 states have (on average 2.393410852713178) internal successors, (1235), 527 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1235 transitions. [2023-12-02 19:29:24,660 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1235 transitions. Word has length 11 [2023-12-02 19:29:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:24,661 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1235 transitions. [2023-12-02 19:29:24,661 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) [2023-12-02 19:29:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1235 transitions. [2023-12-02 19:29:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 19:29:24,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:24,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:24,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 19:29:24,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:24,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash -711202270, now seen corresponding path program 1 times [2023-12-02 19:29:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:24,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766742729] [2023-12-02 19:29:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:24,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766742729] [2023-12-02 19:29:24,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766742729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:24,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:24,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:29:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705764766] [2023-12-02 19:29:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:24,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:29:24,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:29:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:29:24,951 INFO L87 Difference]: Start difference. First operand 528 states and 1235 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-12-02 19:29:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:25,107 INFO L93 Difference]: Finished difference Result 564 states and 1317 transitions. [2023-12-02 19:29:25,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:29:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2023-12-02 19:29:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:25,112 INFO L225 Difference]: With dead ends: 564 [2023-12-02 19:29:25,112 INFO L226 Difference]: Without dead ends: 564 [2023-12-02 19:29:25,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:29:25,114 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:25,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 89 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:25,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-12-02 19:29:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2023-12-02 19:29:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 549 states have (on average 2.389799635701275) internal successors, (1312), 560 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1312 transitions. [2023-12-02 19:29:25,141 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1312 transitions. Word has length 11 [2023-12-02 19:29:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:25,142 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1312 transitions. [2023-12-02 19:29:25,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-12-02 19:29:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1312 transitions. [2023-12-02 19:29:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:29:25,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:25,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:25,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 19:29:25,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:25,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1193433590, now seen corresponding path program 1 times [2023-12-02 19:29:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:25,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761685327] [2023-12-02 19:29:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:25,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:25,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761685327] [2023-12-02 19:29:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761685327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:29:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824790735] [2023-12-02 19:29:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:25,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:29:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:29:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:29:25,623 INFO L87 Difference]: Start difference. First operand 561 states and 1312 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:25,837 INFO L93 Difference]: Finished difference Result 792 states and 1845 transitions. [2023-12-02 19:29:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:29:25,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 19:29:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:25,843 INFO L225 Difference]: With dead ends: 792 [2023-12-02 19:29:25,843 INFO L226 Difference]: Without dead ends: 792 [2023-12-02 19:29:25,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:29:25,845 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 99 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:25,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 88 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:29:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-02 19:29:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 621. [2023-12-02 19:29:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 609 states have (on average 2.4088669950738915) internal successors, (1467), 620 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1467 transitions. [2023-12-02 19:29:25,869 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1467 transitions. Word has length 12 [2023-12-02 19:29:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:25,869 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 1467 transitions. [2023-12-02 19:29:25,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1467 transitions. [2023-12-02 19:29:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:29:25,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:25,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 19:29:25,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:25,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash -572463128, now seen corresponding path program 2 times [2023-12-02 19:29:25,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:25,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723678085] [2023-12-02 19:29:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:26,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723678085] [2023-12-02 19:29:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723678085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:29:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620511949] [2023-12-02 19:29:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:26,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:29:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:26,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:29:26,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:29:26,229 INFO L87 Difference]: Start difference. First operand 621 states and 1467 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:26,445 INFO L93 Difference]: Finished difference Result 792 states and 1860 transitions. [2023-12-02 19:29:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:29:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 19:29:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:26,452 INFO L225 Difference]: With dead ends: 792 [2023-12-02 19:29:26,452 INFO L226 Difference]: Without dead ends: 792 [2023-12-02 19:29:26,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:29:26,453 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 112 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:29:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-02 19:29:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 576. [2023-12-02 19:29:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 2.4148936170212765) internal successors, (1362), 575 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1362 transitions. [2023-12-02 19:29:26,477 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1362 transitions. Word has length 12 [2023-12-02 19:29:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:26,477 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 1362 transitions. [2023-12-02 19:29:26,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1362 transitions. [2023-12-02 19:29:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 19:29:26,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:26,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:26,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 19:29:26,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:26,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -572432247, now seen corresponding path program 1 times [2023-12-02 19:29:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990334201] [2023-12-02 19:29:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:26,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:26,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990334201] [2023-12-02 19:29:26,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990334201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:26,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:26,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:29:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132857256] [2023-12-02 19:29:26,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:26,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:29:26,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:29:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:29:26,550 INFO L87 Difference]: Start difference. First operand 576 states and 1362 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:26,661 INFO L93 Difference]: Finished difference Result 624 states and 1463 transitions. [2023-12-02 19:29:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:29:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 19:29:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:26,667 INFO L225 Difference]: With dead ends: 624 [2023-12-02 19:29:26,667 INFO L226 Difference]: Without dead ends: 624 [2023-12-02 19:29:26,667 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 [2023-12-02 19:29:26,668 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:26,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-12-02 19:29:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2023-12-02 19:29:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 612 states have (on average 2.3905228758169934) internal successors, (1463), 623 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1463 transitions. [2023-12-02 19:29:26,691 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1463 transitions. Word has length 12 [2023-12-02 19:29:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:26,691 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1463 transitions. [2023-12-02 19:29:26,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1463 transitions. [2023-12-02 19:29:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 19:29:26,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:26,692 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:26,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 19:29:26,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:26,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1986709928, now seen corresponding path program 1 times [2023-12-02 19:29:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680807266] [2023-12-02 19:29:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:27,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680807266] [2023-12-02 19:29:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680807266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110487096] [2023-12-02 19:29:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:27,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:27,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:29:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:27,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 19:29:27,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:27,484 INFO L378 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 15 treesize of output 1 [2023-12-02 19:29:27,554 INFO L378 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 13 [2023-12-02 19:29:27,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:27,598 INFO L378 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 18 [2023-12-02 19:29:27,662 INFO L378 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 33 treesize of output 25 [2023-12-02 19:29:27,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-12-02 19:29:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:27,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:27,817 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_190 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_7| Int)) (or (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_190)) |c_~#stored_elements~0.base| v_ArrVal_191) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_7|)) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< 1 v_ArrVal_190))) is different from false [2023-12-02 19:29:27,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:27,842 INFO L378 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 64 treesize of output 53 [2023-12-02 19:29:27,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:27,856 INFO L378 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 75 treesize of output 75 [2023-12-02 19:29:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 36 treesize of output 24 [2023-12-02 19:29:27,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2023-12-02 19:29:27,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:27,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 76 [2023-12-02 19:29:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110487096] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [409821691] [2023-12-02 19:29:30,357 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:30,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:30,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-12-02 19:29:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864074978] [2023-12-02 19:29:30,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:30,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 19:29:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 19:29:30,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=301, Unknown=6, NotChecked=36, Total=420 [2023-12-02 19:29:30,362 INFO L87 Difference]: Start difference. First operand 624 states and 1463 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:31,144 INFO L93 Difference]: Finished difference Result 1232 states and 2926 transitions. [2023-12-02 19:29:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:29:31,145 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 19:29:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:31,153 INFO L225 Difference]: With dead ends: 1232 [2023-12-02 19:29:31,153 INFO L226 Difference]: Without dead ends: 1232 [2023-12-02 19:29:31,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=245, Invalid=683, Unknown=6, NotChecked=58, Total=992 [2023-12-02 19:29:31,154 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 586 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:31,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 229 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 526 Invalid, 0 Unknown, 172 Unchecked, 0.4s Time] [2023-12-02 19:29:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2023-12-02 19:29:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 782. [2023-12-02 19:29:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 770 states have (on average 2.468831168831169) internal successors, (1901), 781 states have internal predecessors, (1901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1901 transitions. [2023-12-02 19:29:31,177 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1901 transitions. Word has length 15 [2023-12-02 19:29:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:31,177 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1901 transitions. [2023-12-02 19:29:31,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1901 transitions. [2023-12-02 19:29:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 19:29:31,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:31,178 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:31,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:29:31,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:31,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:31,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1261472658, now seen corresponding path program 1 times [2023-12-02 19:29:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314212458] [2023-12-02 19:29:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:31,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314212458] [2023-12-02 19:29:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314212458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:31,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:29:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440866540] [2023-12-02 19:29:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:29:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:29:31,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:29:31,625 INFO L87 Difference]: Start difference. First operand 782 states and 1901 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:31,750 INFO L93 Difference]: Finished difference Result 779 states and 1879 transitions. [2023-12-02 19:29:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:29:31,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 [2023-12-02 19:29:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:31,756 INFO L225 Difference]: With dead ends: 779 [2023-12-02 19:29:31,757 INFO L226 Difference]: Without dead ends: 779 [2023-12-02 19:29:31,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 19:29:31,757 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:31,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2023-12-02 19:29:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2023-12-02 19:29:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 767 states have (on average 2.4498044328552804) internal successors, (1879), 778 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1879 transitions. [2023-12-02 19:29:31,775 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1879 transitions. Word has length 16 [2023-12-02 19:29:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:31,775 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1879 transitions. [2023-12-02 19:29:31,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1879 transitions. [2023-12-02 19:29:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:29:31,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:31,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:31,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 19:29:31,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:31,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1126645114, now seen corresponding path program 1 times [2023-12-02 19:29:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903141143] [2023-12-02 19:29:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:32,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903141143] [2023-12-02 19:29:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903141143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:32,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:29:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145920636] [2023-12-02 19:29:32,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:32,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:29:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:29:32,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:29:32,091 INFO L87 Difference]: Start difference. First operand 779 states and 1879 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:32,252 INFO L93 Difference]: Finished difference Result 854 states and 2054 transitions. [2023-12-02 19:29:32,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:29:32,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 19:29:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:32,258 INFO L225 Difference]: With dead ends: 854 [2023-12-02 19:29:32,258 INFO L226 Difference]: Without dead ends: 854 [2023-12-02 19:29:32,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:29:32,259 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 67 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:32,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 95 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:29:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2023-12-02 19:29:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 809. [2023-12-02 19:29:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 797 states have (on average 2.4454203262233376) internal successors, (1949), 808 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1949 transitions. [2023-12-02 19:29:32,277 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1949 transitions. Word has length 17 [2023-12-02 19:29:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:32,278 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1949 transitions. [2023-12-02 19:29:32,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1949 transitions. [2023-12-02 19:29:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:29:32,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:32,279 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:32,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 19:29:32,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:32,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -429872346, now seen corresponding path program 1 times [2023-12-02 19:29:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079862110] [2023-12-02 19:29:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:32,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079862110] [2023-12-02 19:29:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079862110] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701825082] [2023-12-02 19:29:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:32,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:32,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:32,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:29:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:32,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 19:29:32,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:32,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:32,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:29:32,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:29:32,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-12-02 19:29:32,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:32,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-12-02 19:29:32,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:32,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:32,820 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:29:32,900 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:33,010 INFO L378 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 38 treesize of output 31 [2023-12-02 19:29:33,157 INFO L378 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 64 treesize of output 51 [2023-12-02 19:29:33,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:33,215 INFO L378 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 55 treesize of output 40 [2023-12-02 19:29:33,303 INFO L378 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 63 treesize of output 47 [2023-12-02 19:29:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:33,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:33,409 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_303) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|))))) is different from false [2023-12-02 19:29:33,419 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_303) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|))))) is different from false [2023-12-02 19:29:33,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24|) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_303) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|))))))) is different from false [2023-12-02 19:29:33,459 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_303) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24|)))) is different from false [2023-12-02 19:29:33,485 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (forall ((v_ArrVal_303 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_303) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|)) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_24|)))) (< (+ 2147483649 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) 0))) is different from false [2023-12-02 19:29:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 19:29:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701825082] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063957295] [2023-12-02 19:29:33,651 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:33,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-12-02 19:29:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679566008] [2023-12-02 19:29:33,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:33,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 19:29:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 19:29:33,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=254, Unknown=5, NotChecked=190, Total=552 [2023-12-02 19:29:33,653 INFO L87 Difference]: Start difference. First operand 809 states and 1949 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:36,586 INFO L93 Difference]: Finished difference Result 2059 states and 4835 transitions. [2023-12-02 19:29:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 19:29:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 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 [2023-12-02 19:29:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:36,598 INFO L225 Difference]: With dead ends: 2059 [2023-12-02 19:29:36,598 INFO L226 Difference]: Without dead ends: 2059 [2023-12-02 19:29:36,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=448, Invalid=1289, Unknown=5, NotChecked=420, Total=2162 [2023-12-02 19:29:36,600 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 472 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1689 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:36,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 339 Invalid, 2528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 807 Invalid, 0 Unknown, 1689 Unchecked, 1.5s Time] [2023-12-02 19:29:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2023-12-02 19:29:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 878. [2023-12-02 19:29:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 866 states have (on average 2.4699769053117784) internal successors, (2139), 877 states have internal predecessors, (2139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2139 transitions. [2023-12-02 19:29:36,638 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2139 transitions. Word has length 17 [2023-12-02 19:29:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:36,638 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 2139 transitions. [2023-12-02 19:29:36,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2139 transitions. [2023-12-02 19:29:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 19:29:36,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:36,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:36,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 19:29:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:36,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:36,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:36,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1317184552, now seen corresponding path program 2 times [2023-12-02 19:29:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583726734] [2023-12-02 19:29:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:37,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583726734] [2023-12-02 19:29:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583726734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:29:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:29:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 19:29:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328039413] [2023-12-02 19:29:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:29:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 19:29:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 19:29:37,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 19:29:37,140 INFO L87 Difference]: Start difference. First operand 878 states and 2139 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:37,343 INFO L93 Difference]: Finished difference Result 878 states and 2124 transitions. [2023-12-02 19:29:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:29:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 19:29:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:37,350 INFO L225 Difference]: With dead ends: 878 [2023-12-02 19:29:37,350 INFO L226 Difference]: Without dead ends: 878 [2023-12-02 19:29:37,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 19:29:37,351 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:37,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 19:29:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2023-12-02 19:29:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 833. [2023-12-02 19:29:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 821 states have (on average 2.459196102314251) internal successors, (2019), 832 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2019 transitions. [2023-12-02 19:29:37,381 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2019 transitions. Word has length 17 [2023-12-02 19:29:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:37,381 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2019 transitions. [2023-12-02 19:29:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2019 transitions. [2023-12-02 19:29:37,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:29:37,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:37,383 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:37,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 19:29:37,383 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:37,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2118827658, now seen corresponding path program 1 times [2023-12-02 19:29:37,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:37,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250498008] [2023-12-02 19:29:37,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:37,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:37,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:37,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250498008] [2023-12-02 19:29:37,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250498008] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:37,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848019149] [2023-12-02 19:29:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:37,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:37,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:37,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 19:29:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:38,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 19:29:38,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:38,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:29:38,121 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:29:38,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:29:38,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,151 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:29:38,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:29:38,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,165 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:29:38,269 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:38,369 INFO L378 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 38 treesize of output 31 [2023-12-02 19:29:38,530 INFO L378 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 51 treesize of output 38 [2023-12-02 19:29:38,615 INFO L378 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 64 treesize of output 51 [2023-12-02 19:29:38,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:38,673 INFO L378 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 55 treesize of output 40 [2023-12-02 19:29:38,747 INFO L378 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 63 treesize of output 47 [2023-12-02 19:29:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:38,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:38,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_394 (Array Int Int))) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|))))) is different from false [2023-12-02 19:29:38,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|))))) is different from false [2023-12-02 19:29:38,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| Int)) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30|) (< 0 (+ 2147483650 (select (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| 1)))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|))))))) is different from false [2023-12-02 19:29:38,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30|) (< 0 (+ (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2023-12-02 19:29:38,972 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_15| Int) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_394 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< 0 (+ (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_392) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_394) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_15|)) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_30|)))) (< (+ 2147483649 |t1Thread1of1ForFork0_enqueue_#t~post38#1|) 0))) is different from false [2023-12-02 19:29:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 19:29:39,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848019149] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:39,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2145248415] [2023-12-02 19:29:39,141 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:39,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:39,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-12-02 19:29:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003161430] [2023-12-02 19:29:39,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:39,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:29:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:39,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:29:39,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=366, Unknown=6, NotChecked=220, Total=702 [2023-12-02 19:29:39,143 INFO L87 Difference]: Start difference. First operand 833 states and 2019 transitions. Second operand has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:40,773 INFO L93 Difference]: Finished difference Result 1374 states and 3331 transitions. [2023-12-02 19:29:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 19:29:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:29:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:40,783 INFO L225 Difference]: With dead ends: 1374 [2023-12-02 19:29:40,783 INFO L226 Difference]: Without dead ends: 1374 [2023-12-02 19:29:40,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=633, Unknown=9, NotChecked=290, Total=1122 [2023-12-02 19:29:40,784 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 593 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 46 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 1712 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:40,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 387 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 721 Invalid, 28 Unknown, 1712 Unchecked, 1.1s Time] [2023-12-02 19:29:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-12-02 19:29:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 750. [2023-12-02 19:29:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 738 states have (on average 2.478319783197832) internal successors, (1829), 749 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1829 transitions. [2023-12-02 19:29:40,811 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1829 transitions. Word has length 18 [2023-12-02 19:29:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:40,812 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 1829 transitions. [2023-12-02 19:29:40,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:40,812 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1829 transitions. [2023-12-02 19:29:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 19:29:40,813 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:40,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:40,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 19:29:41,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 19:29:41,014 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:41,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -441140196, now seen corresponding path program 1 times [2023-12-02 19:29:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:41,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326460109] [2023-12-02 19:29:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:41,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:41,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:41,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326460109] [2023-12-02 19:29:41,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326460109] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801830662] [2023-12-02 19:29:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:41,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:41,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:41,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:41,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 19:29:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:41,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 19:29:41,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:41,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:41,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-12-02 19:29:41,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:41,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:29:41,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:41,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:41,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-02 19:29:41,833 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:41,904 INFO L378 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 42 [2023-12-02 19:29:42,073 INFO L378 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 62 treesize of output 49 [2023-12-02 19:29:42,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:42,127 INFO L378 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 53 treesize of output 38 [2023-12-02 19:29:42,193 INFO L378 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 61 treesize of output 45 [2023-12-02 19:29:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:42,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:42,271 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_452 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_452) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:29:42,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_452 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_452) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|)))) is different from false [2023-12-02 19:29:42,349 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_452 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_452) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 19:29:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 19:29:42,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801830662] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:42,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107910121] [2023-12-02 19:29:42,529 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:42,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:42,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-12-02 19:29:42,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940199231] [2023-12-02 19:29:42,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:42,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 19:29:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 19:29:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=254, Unknown=3, NotChecked=108, Total=462 [2023-12-02 19:29:42,531 INFO L87 Difference]: Start difference. First operand 750 states and 1829 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:42,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_452 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_452) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse4) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (v_ArrVal_452 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_21| Int)) (let ((.cse5 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_21|)))) (or (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33|) (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_33| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36| 1))) |c_~#stored_elements~0.base| v_ArrVal_452) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|)) .cse4) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_36|)))))) is different from false [2023-12-02 19:29:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:43,211 INFO L93 Difference]: Finished difference Result 857 states and 2070 transitions. [2023-12-02 19:29:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:29:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 19:29:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:43,216 INFO L225 Difference]: With dead ends: 857 [2023-12-02 19:29:43,216 INFO L226 Difference]: Without dead ends: 857 [2023-12-02 19:29:43,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=371, Unknown=4, NotChecked=180, Total=702 [2023-12-02 19:29:43,217 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 8 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:43,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 297 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 494 Invalid, 18 Unknown, 380 Unchecked, 0.5s Time] [2023-12-02 19:29:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-12-02 19:29:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 787. [2023-12-02 19:29:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 775 states have (on average 2.472258064516129) internal successors, (1916), 786 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1916 transitions. [2023-12-02 19:29:43,234 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1916 transitions. Word has length 18 [2023-12-02 19:29:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:43,234 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1916 transitions. [2023-12-02 19:29:43,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1916 transitions. [2023-12-02 19:29:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:29:43,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:43,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:43,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 19:29:43,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 19:29:43,439 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:43,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:43,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2052888008, now seen corresponding path program 1 times [2023-12-02 19:29:43,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:43,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226953042] [2023-12-02 19:29:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:43,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:44,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226953042] [2023-12-02 19:29:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226953042] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99191075] [2023-12-02 19:29:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:44,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:44,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 19:29:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:44,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:29:44,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:29:44,522 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:29:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:29:44,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,550 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:29:44,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:29:44,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,563 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:29:44,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 19:29:44,697 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:44,767 INFO L378 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 42 [2023-12-02 19:29:44,895 INFO L378 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 62 treesize of output 49 [2023-12-02 19:29:44,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:44,959 INFO L378 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 53 treesize of output 38 [2023-12-02 19:29:45,038 INFO L378 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 61 treesize of output 45 [2023-12-02 19:29:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:45,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:45,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:29:45,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 19:29:45,226 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42|)))) is different from false [2023-12-02 19:29:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 19:29:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99191075] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1823134091] [2023-12-02 19:29:45,535 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:45,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:45,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 19:29:45,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121198225] [2023-12-02 19:29:45,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:45,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 19:29:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:45,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 19:29:45,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=350, Unknown=8, NotChecked=126, Total=600 [2023-12-02 19:29:45,538 INFO L87 Difference]: Start difference. First operand 787 states and 1916 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:46,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_516 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_38| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| Int)) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42|) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_38| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse3) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_38|)))) (forall ((v_ArrVal_516 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42|) (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_42| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse3) 2147483647)))))) is different from false [2023-12-02 19:29:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:46,666 INFO L93 Difference]: Finished difference Result 1461 states and 3475 transitions. [2023-12-02 19:29:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 19:29:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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 [2023-12-02 19:29:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:46,674 INFO L225 Difference]: With dead ends: 1461 [2023-12-02 19:29:46,674 INFO L226 Difference]: Without dead ends: 1461 [2023-12-02 19:29:46,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=208, Invalid=553, Unknown=11, NotChecked=220, Total=992 [2023-12-02 19:29:46,675 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 454 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 17 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 1109 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:46,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 323 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 575 Invalid, 35 Unknown, 1109 Unchecked, 0.8s Time] [2023-12-02 19:29:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2023-12-02 19:29:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1027. [2023-12-02 19:29:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1015 states have (on average 2.5310344827586206) internal successors, (2569), 1026 states have internal predecessors, (2569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 2569 transitions. [2023-12-02 19:29:46,702 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 2569 transitions. Word has length 19 [2023-12-02 19:29:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:46,702 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 2569 transitions. [2023-12-02 19:29:46,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 2569 transitions. [2023-12-02 19:29:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 19:29:46,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:46,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:46,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 19:29:46,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 19:29:46,905 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:46,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1259148600, now seen corresponding path program 2 times [2023-12-02 19:29:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325164975] [2023-12-02 19:29:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:47,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325164975] [2023-12-02 19:29:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325164975] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851199832] [2023-12-02 19:29:47,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:29:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:47,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:47,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:47,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:29:47,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:29:47,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:29:47,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 19:29:47,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:47,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:47,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:47,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:29:48,010 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:29:48,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:29:48,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:48,036 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:29:48,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:29:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:48,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:48,049 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:29:48,125 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:48,203 INFO L378 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 42 [2023-12-02 19:29:48,321 INFO L378 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 49 treesize of output 36 [2023-12-02 19:29:48,398 INFO L378 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 62 treesize of output 49 [2023-12-02 19:29:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:48,446 INFO L378 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 53 treesize of output 38 [2023-12-02 19:29:48,509 INFO L378 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 61 treesize of output 45 [2023-12-02 19:29:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:48,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:48,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_580 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_580) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:29:48,652 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_580 (Array Int Int))) (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_580) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:29:48,666 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_580 (Array Int Int))) (let ((.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1)))) |c_~#stored_elements~0.base| v_ArrVal_580) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|))))) is different from false [2023-12-02 19:29:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851199832] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476918583] [2023-12-02 19:29:48,954 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:48,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 19:29:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249705988] [2023-12-02 19:29:48,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:48,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 19:29:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:48,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 19:29:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=359, Unknown=9, NotChecked=126, Total=600 [2023-12-02 19:29:48,956 INFO L87 Difference]: Start difference. First operand 1027 states and 2569 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:49,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|))) (and (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_580 (Array Int Int))) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1)))) |c_~#stored_elements~0.base| v_ArrVal_580) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) .cse4) 2147483647) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int)) (< (select (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_27|) .cse4) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| Int) (v_ArrVal_578 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_580 (Array Int Int))) (let ((.cse7 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_29|))) (let ((.cse8 (select .cse7 .cse1))) (or (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|) (= .cse8 20) (< (select (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578) |c_~#queue~0.base| (store (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_43| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_578) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1))) |c_~#stored_elements~0.base| v_ArrVal_580) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|)) .cse4) 2147483647)))))))) is different from false [2023-12-02 19:29:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:50,653 INFO L93 Difference]: Finished difference Result 1629 states and 4046 transitions. [2023-12-02 19:29:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 19:29:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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 [2023-12-02 19:29:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:50,662 INFO L225 Difference]: With dead ends: 1629 [2023-12-02 19:29:50,662 INFO L226 Difference]: Without dead ends: 1629 [2023-12-02 19:29:50,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=535, Unknown=10, NotChecked=212, Total=930 [2023-12-02 19:29:50,663 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 308 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 28 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 1288 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:50,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 390 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 706 Invalid, 44 Unknown, 1288 Unchecked, 1.3s Time] [2023-12-02 19:29:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2023-12-02 19:29:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1125. [2023-12-02 19:29:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1113 states have (on average 2.5858041329739443) internal successors, (2878), 1124 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2878 transitions. [2023-12-02 19:29:50,686 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 2878 transitions. Word has length 19 [2023-12-02 19:29:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:50,686 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 2878 transitions. [2023-12-02 19:29:50,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 2878 transitions. [2023-12-02 19:29:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:29:50,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:50,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:50,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:29:50,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 19:29:50,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:50,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:50,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1266054527, now seen corresponding path program 1 times [2023-12-02 19:29:50,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:50,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938272510] [2023-12-02 19:29:50,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:50,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:51,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938272510] [2023-12-02 19:29:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938272510] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199792155] [2023-12-02 19:29:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:51,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:51,280 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:51,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 19:29:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:51,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 19:29:51,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:51,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:51,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:51,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:29:51,435 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 19:29:51,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2023-12-02 19:29:51,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:51,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:51,444 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:29:51,511 INFO L378 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 43 treesize of output 34 [2023-12-02 19:29:51,566 INFO L378 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 38 treesize of output 31 [2023-12-02 19:29:51,703 INFO L378 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 44 [2023-12-02 19:29:51,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:51,747 INFO L378 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 55 treesize of output 40 [2023-12-02 19:29:51,805 INFO L378 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 74 treesize of output 55 [2023-12-02 19:29:51,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 60 [2023-12-02 19:29:51,972 INFO L378 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 73 treesize of output 53 [2023-12-02 19:29:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:52,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:52,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_642 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_642) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1))))) is different from false [2023-12-02 19:29:52,158 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_642 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_642) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1))))) is different from false [2023-12-02 19:29:52,216 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55|) (< 0 (+ (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| 1))) |c_~#stored_elements~0.base| v_ArrVal_642) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3)) 2147483650)) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| 2147483649) 0)))) is different from false [2023-12-02 19:29:52,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55|) (< 0 (+ (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| 1))) |c_~#stored_elements~0.base| v_ArrVal_642) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse3)) 2147483650)) (< (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_55| 2147483649) 0)))) is different from false [2023-12-02 19:29:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:29:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199792155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1624040285] [2023-12-02 19:29:52,386 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:52,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-12-02 19:29:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208709727] [2023-12-02 19:29:52,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:29:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:52,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:29:52,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=401, Unknown=4, NotChecked=180, Total=702 [2023-12-02 19:29:52,388 INFO L87 Difference]: Start difference. First operand 1125 states and 2878 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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) [2023-12-02 19:29:54,920 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] [2023-12-02 19:29:55,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_642 (Array Int Int))) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_642) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)))) (<= 1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int)) (< 0 (+ 2147483650 (select (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)) .cse1)))))) is different from false [2023-12-02 19:29:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:56,360 INFO L93 Difference]: Finished difference Result 2166 states and 5328 transitions. [2023-12-02 19:29:56,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 19:29:56,360 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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 [2023-12-02 19:29:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:56,368 INFO L225 Difference]: With dead ends: 2166 [2023-12-02 19:29:56,368 INFO L226 Difference]: Without dead ends: 2166 [2023-12-02 19:29:56,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=273, Invalid=1002, Unknown=5, NotChecked=360, Total=1640 [2023-12-02 19:29:56,370 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 250 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1364 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:56,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 551 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1057 Invalid, 1 Unknown, 1364 Unchecked, 3.3s Time] [2023-12-02 19:29:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2023-12-02 19:29:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 1560. [2023-12-02 19:29:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1548 states have (on average 2.613049095607235) internal successors, (4045), 1559 states have internal predecessors, (4045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 4045 transitions. [2023-12-02 19:29:56,406 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 4045 transitions. Word has length 20 [2023-12-02 19:29:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:56,406 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 4045 transitions. [2023-12-02 19:29:56,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 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) [2023-12-02 19:29:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 4045 transitions. [2023-12-02 19:29:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:29:56,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:56,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:56,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 19:29:56,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 19:29:56,609 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:56,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1435407403, now seen corresponding path program 1 times [2023-12-02 19:29:56,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:56,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468973230] [2023-12-02 19:29:56,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:57,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:29:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468973230] [2023-12-02 19:29:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468973230] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:29:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934042826] [2023-12-02 19:29:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:57,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:29:57,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:29:57,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:29:57,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 19:29:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:29:57,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 19:29:57,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:29:57,386 INFO L378 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 35 treesize of output 19 [2023-12-02 19:29:57,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:29:57,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-12-02 19:29:57,468 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-12-02 19:29:57,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-12-02 19:29:57,505 INFO L378 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 33 treesize of output 17 [2023-12-02 19:29:57,514 INFO L378 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 25 treesize of output 13 [2023-12-02 19:29:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:57,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:29:57,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_704 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int)) (< 0 (+ (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_704) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_35|)) .cse1)) 2147483650))) is different from false [2023-12-02 19:29:57,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:57,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-12-02 19:29:57,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:57,803 INFO L378 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 74 treesize of output 74 [2023-12-02 19:29:57,809 INFO L378 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 36 treesize of output 24 [2023-12-02 19:29:57,822 INFO L378 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 17 treesize of output 9 [2023-12-02 19:29:57,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:29:57,842 INFO L378 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 59 treesize of output 47 [2023-12-02 19:29:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:29:57,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934042826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:29:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [841936081] [2023-12-02 19:29:57,922 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:29:57,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:29:57,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-12-02 19:29:57,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148163065] [2023-12-02 19:29:57,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:29:57,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:29:57,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:29:57,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:29:57,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=587, Unknown=5, NotChecked=50, Total=756 [2023-12-02 19:29:57,924 INFO L87 Difference]: Start difference. First operand 1560 states and 4045 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:29:59,588 INFO L93 Difference]: Finished difference Result 2509 states and 6186 transitions. [2023-12-02 19:29:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 19:29:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:29:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:29:59,598 INFO L225 Difference]: With dead ends: 2509 [2023-12-02 19:29:59,598 INFO L226 Difference]: Without dead ends: 2509 [2023-12-02 19:29:59,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=440, Invalid=1629, Unknown=5, NotChecked=88, Total=2162 [2023-12-02 19:29:59,600 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 770 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 19:29:59,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 513 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1244 Invalid, 0 Unknown, 340 Unchecked, 0.9s Time] [2023-12-02 19:29:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2023-12-02 19:29:59,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1643. [2023-12-02 19:29:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1631 states have (on average 2.6057633353770693) internal successors, (4250), 1642 states have internal predecessors, (4250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4250 transitions. [2023-12-02 19:29:59,654 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4250 transitions. Word has length 21 [2023-12-02 19:29:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:29:59,654 INFO L495 AbstractCegarLoop]: Abstraction has 1643 states and 4250 transitions. [2023-12-02 19:29:59,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:29:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4250 transitions. [2023-12-02 19:29:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 19:29:59,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:29:59,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:29:59,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 19:29:59,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 19:29:59,857 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:29:59,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:29:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash -243991179, now seen corresponding path program 2 times [2023-12-02 19:29:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:29:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859495095] [2023-12-02 19:29:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:29:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:29:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:00,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859495095] [2023-12-02 19:30:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859495095] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478144452] [2023-12-02 19:30:00,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:30:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:00,240 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:00,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 19:30:00,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:30:00,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:30:00,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 19:30:00,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:00,406 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:30:00,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:30:00,560 INFO L378 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 19 treesize of output 1 [2023-12-02 19:30:00,585 INFO L378 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 20 treesize of output 15 [2023-12-02 19:30:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:00,611 INFO L378 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 20 treesize of output 15 [2023-12-02 19:30:00,658 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-02 19:30:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 56 [2023-12-02 19:30:00,682 INFO L378 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 [2023-12-02 19:30:00,688 INFO L378 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 9 [2023-12-02 19:30:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:00,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:00,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int))) (or (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_767) |c_~#stored_elements~0.base| v_ArrVal_768) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_39|)) .cse1)))) (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_39| 2147483648) 0))) is different from false [2023-12-02 19:30:00,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:00,822 INFO L378 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 60 treesize of output 49 [2023-12-02 19:30:00,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:00,832 INFO L378 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 250 treesize of output 248 [2023-12-02 19:30:00,840 INFO L378 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 67 treesize of output 55 [2023-12-02 19:30:00,847 INFO L378 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 78 treesize of output 54 [2023-12-02 19:30:00,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2023-12-02 19:30:00,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:00,881 INFO L378 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 56 treesize of output 48 [2023-12-02 19:30:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478144452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403133395] [2023-12-02 19:30:01,014 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:01,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-12-02 19:30:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971287241] [2023-12-02 19:30:01,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 19:30:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 19:30:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=461, Unknown=5, NotChecked=44, Total=600 [2023-12-02 19:30:01,016 INFO L87 Difference]: Start difference. First operand 1643 states and 4250 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:01,358 INFO L93 Difference]: Finished difference Result 1716 states and 4395 transitions. [2023-12-02 19:30:01,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 19:30:01,358 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 19:30:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:01,362 INFO L225 Difference]: With dead ends: 1716 [2023-12-02 19:30:01,362 INFO L226 Difference]: Without dead ends: 1716 [2023-12-02 19:30:01,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=598, Unknown=5, NotChecked=52, Total=812 [2023-12-02 19:30:01,363 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 288 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:01,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 227 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 411 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2023-12-02 19:30:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2023-12-02 19:30:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1418. [2023-12-02 19:30:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1407 states have (on average 2.5600568585643213) internal successors, (3602), 1417 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 3602 transitions. [2023-12-02 19:30:01,388 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 3602 transitions. Word has length 21 [2023-12-02 19:30:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:01,388 INFO L495 AbstractCegarLoop]: Abstraction has 1418 states and 3602 transitions. [2023-12-02 19:30:01,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 3602 transitions. [2023-12-02 19:30:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:30:01,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:01,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:01,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 19:30:01,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:01,590 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:01,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:01,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1026208692, now seen corresponding path program 1 times [2023-12-02 19:30:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204586928] [2023-12-02 19:30:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:02,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204586928] [2023-12-02 19:30:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204586928] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945131145] [2023-12-02 19:30:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:02,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:02,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:02,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:02,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 19:30:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:02,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 19:30:02,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:02,171 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:30:02,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:30:02,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:02,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:30:02,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:02,202 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:30:02,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:30:02,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:02,214 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:30:02,297 INFO L378 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 43 treesize of output 34 [2023-12-02 19:30:02,352 INFO L378 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 38 treesize of output 31 [2023-12-02 19:30:02,480 INFO L378 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 44 [2023-12-02 19:30:02,522 INFO L378 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 33 [2023-12-02 19:30:02,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:02,558 INFO L378 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 33 [2023-12-02 19:30:02,608 INFO L378 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 65 treesize of output 48 [2023-12-02 19:30:02,671 INFO L378 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 72 treesize of output 53 [2023-12-02 19:30:02,742 INFO L378 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 64 treesize of output 46 [2023-12-02 19:30:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:03,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:03,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:30:03,617 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:30:03,625 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:30:03,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse3)) 2147483647)))) is different from false [2023-12-02 19:30:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:30:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945131145] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127036239] [2023-12-02 19:30:03,860 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:03,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2023-12-02 19:30:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302829602] [2023-12-02 19:30:03,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:03,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 19:30:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:03,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 19:30:03,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=368, Unknown=8, NotChecked=180, Total=702 [2023-12-02 19:30:03,862 INFO L87 Difference]: Start difference. First operand 1418 states and 3602 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:06,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (< .cse0 2147483647) (forall ((v_ArrVal_836 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse2) 2147483647))) (forall ((v_ArrVal_836 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)))) (or (< (select (let ((.cse5 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse2) 2147483647) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|)))) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse2) 2147483647))))) is different from false [2023-12-02 19:30:06,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (< .cse0 2147483647) (forall ((v_ArrVal_836 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse2) 2147483647))) (forall ((v_ArrVal_836 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_45| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| Int)) (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_45|)))) (or (< (select (let ((.cse5 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse2) 2147483647) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_76|))))))) is different from false [2023-12-02 19:30:06,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse1) 2147483647)) (forall ((v_ArrVal_836 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_43| Int)) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_836) |c_~#stored_elements~0.base| v_ArrVal_837) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_43|)) .cse1) 2147483647)))) is different from false [2023-12-02 19:30:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:07,221 INFO L93 Difference]: Finished difference Result 2643 states and 6556 transitions. [2023-12-02 19:30:07,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 19:30:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 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 [2023-12-02 19:30:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:07,227 INFO L225 Difference]: With dead ends: 2643 [2023-12-02 19:30:07,228 INFO L226 Difference]: Without dead ends: 2643 [2023-12-02 19:30:07,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=326, Invalid=813, Unknown=11, NotChecked=490, Total=1640 [2023-12-02 19:30:07,229 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 648 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1983 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:07,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 419 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 691 Invalid, 0 Unknown, 1983 Unchecked, 1.1s Time] [2023-12-02 19:30:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2023-12-02 19:30:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1569. [2023-12-02 19:30:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1558 states have (on average 2.58793324775353) internal successors, (4032), 1568 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 4032 transitions. [2023-12-02 19:30:07,264 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 4032 transitions. Word has length 22 [2023-12-02 19:30:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:07,264 INFO L495 AbstractCegarLoop]: Abstraction has 1569 states and 4032 transitions. [2023-12-02 19:30:07,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 4032 transitions. [2023-12-02 19:30:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:30:07,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:07,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:07,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 19:30:07,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:07,466 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:07,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1026209686, now seen corresponding path program 1 times [2023-12-02 19:30:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:07,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926452292] [2023-12-02 19:30:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:07,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:07,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:07,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926452292] [2023-12-02 19:30:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926452292] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:07,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752230624] [2023-12-02 19:30:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:07,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:07,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:07,529 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:07,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 19:30:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:07,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:30:07,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:07,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:30:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752230624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:07,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 19:30:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 19:30:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943969786] [2023-12-02 19:30:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:07,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 19:30:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 19:30:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 19:30:07,667 INFO L87 Difference]: Start difference. First operand 1569 states and 4032 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-12-02 19:30:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:07,759 INFO L93 Difference]: Finished difference Result 1553 states and 3904 transitions. [2023-12-02 19:30:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:30:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2023-12-02 19:30:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:07,763 INFO L225 Difference]: With dead ends: 1553 [2023-12-02 19:30:07,763 INFO L226 Difference]: Without dead ends: 1553 [2023-12-02 19:30:07,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:30:07,764 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 54 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:07,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:30:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2023-12-02 19:30:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1553. [2023-12-02 19:30:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1543 states have (on average 2.5301360985093972) internal successors, (3904), 1552 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 3904 transitions. [2023-12-02 19:30:07,792 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 3904 transitions. Word has length 22 [2023-12-02 19:30:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:07,792 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 3904 transitions. [2023-12-02 19:30:07,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2023-12-02 19:30:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 3904 transitions. [2023-12-02 19:30:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 19:30:07,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:07,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:07,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 19:30:07,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 19:30:07,994 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:07,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:07,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1201749950, now seen corresponding path program 2 times [2023-12-02 19:30:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:07,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201100424] [2023-12-02 19:30:07,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:07,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:08,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201100424] [2023-12-02 19:30:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201100424] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552191214] [2023-12-02 19:30:08,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:30:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:08,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:08,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:30:08,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 19:30:08,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:30:08,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:30:08,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:08,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:08,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:08,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2023-12-02 19:30:08,706 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:30:08,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:30:08,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:08,729 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:30:08,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:30:08,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:08,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:08,739 INFO L378 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 0 case distinctions, treesize of input 27 treesize of output 1 [2023-12-02 19:30:08,802 INFO L378 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 57 treesize of output 48 [2023-12-02 19:30:08,851 INFO L378 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 96 treesize of output 89 [2023-12-02 19:30:08,961 INFO L378 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 71 treesize of output 60 [2023-12-02 19:30:09,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:09,003 INFO L378 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 58 treesize of output 45 [2023-12-02 19:30:09,065 INFO L378 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 85 treesize of output 68 [2023-12-02 19:30:09,145 INFO L378 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 96 treesize of output 77 [2023-12-02 19:30:09,238 INFO L378 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 85 treesize of output 66 [2023-12-02 19:30:09,278 INFO L378 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 86 treesize of output 68 [2023-12-02 19:30:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:09,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:09,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_974) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-12-02 19:30:09,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_974) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-12-02 19:30:09,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (v_ArrVal_971 (Array Int Int))) (< (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_971))) (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_t1Thread1of1ForFork0_enqueue_~x#1_47|)) (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_974) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2023-12-02 19:30:11,648 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_71| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_47| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_83| Int) (v_ArrVal_971 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_83|) (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_83| 1))) |c_~#stored_elements~0.base| v_ArrVal_971))) (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_t1Thread1of1ForFork0_enqueue_~x#1_47|)) (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_71| 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_974) |c_~#queue~0.base|) .cse4)) 2147483647)))) is different from false [2023-12-02 19:30:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 19:30:11,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552191214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:11,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257152601] [2023-12-02 19:30:11,849 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:11,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:11,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 26 [2023-12-02 19:30:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712352868] [2023-12-02 19:30:11,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:11,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 19:30:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 19:30:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=427, Unknown=21, NotChecked=188, Total=756 [2023-12-02 19:30:11,851 INFO L87 Difference]: Start difference. First operand 1553 states and 3904 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:14,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:16,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:18,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:20,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:22,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:24,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:29,681 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] [2023-12-02 19:30:31,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:30:33,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 [1] [2023-12-02 19:30:34,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:30:37,496 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] [2023-12-02 19:30:39,511 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] [2023-12-02 19:30:41,775 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] [2023-12-02 19:30:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:41,838 INFO L93 Difference]: Finished difference Result 3658 states and 9094 transitions. [2023-12-02 19:30:41,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 19:30:41,838 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 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 [2023-12-02 19:30:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:41,845 INFO L225 Difference]: With dead ends: 3658 [2023-12-02 19:30:41,846 INFO L226 Difference]: Without dead ends: 3658 [2023-12-02 19:30:41,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=566, Invalid=1911, Unknown=89, NotChecked=404, Total=2970 [2023-12-02 19:30:41,847 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1022 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 110 mSolverCounterUnsat, 122 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 122 IncrementalHoareTripleChecker+Unknown, 2084 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:41,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 548 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1005 Invalid, 122 Unknown, 2084 Unchecked, 24.2s Time] [2023-12-02 19:30:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2023-12-02 19:30:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 2335. [2023-12-02 19:30:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2325 states have (on average 2.5793548387096776) internal successors, (5997), 2334 states have internal predecessors, (5997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 5997 transitions. [2023-12-02 19:30:41,898 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 5997 transitions. Word has length 22 [2023-12-02 19:30:41,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:41,898 INFO L495 AbstractCegarLoop]: Abstraction has 2335 states and 5997 transitions. [2023-12-02 19:30:41,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 5997 transitions. [2023-12-02 19:30:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 19:30:41,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:41,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:41,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:30:42,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 19:30:42,101 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:42,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1747729847, now seen corresponding path program 1 times [2023-12-02 19:30:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674051959] [2023-12-02 19:30:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:42,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674051959] [2023-12-02 19:30:42,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674051959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:30:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789214059] [2023-12-02 19:30:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:42,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:30:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:42,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:30:42,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:30:42,145 INFO L87 Difference]: Start difference. First operand 2335 states and 5997 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:42,230 INFO L93 Difference]: Finished difference Result 2319 states and 5782 transitions. [2023-12-02 19:30:42,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:30:42,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 19:30:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:42,235 INFO L225 Difference]: With dead ends: 2319 [2023-12-02 19:30:42,235 INFO L226 Difference]: Without dead ends: 2319 [2023-12-02 19:30:42,236 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 [2023-12-02 19:30:42,236 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:42,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:30:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-12-02 19:30:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2319. [2023-12-02 19:30:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 2310 states have (on average 2.503030303030303) internal successors, (5782), 2318 states have internal predecessors, (5782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 5782 transitions. [2023-12-02 19:30:42,284 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 5782 transitions. Word has length 23 [2023-12-02 19:30:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:42,285 INFO L495 AbstractCegarLoop]: Abstraction has 2319 states and 5782 transitions. [2023-12-02 19:30:42,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 5782 transitions. [2023-12-02 19:30:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:30:42,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:42,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:42,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 19:30:42,288 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:42,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -347116464, now seen corresponding path program 1 times [2023-12-02 19:30:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902017141] [2023-12-02 19:30:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:42,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902017141] [2023-12-02 19:30:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902017141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:30:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:30:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:30:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573091681] [2023-12-02 19:30:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:30:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:30:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:30:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:30:42,340 INFO L87 Difference]: Start difference. First operand 2319 states and 5782 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:42,396 INFO L93 Difference]: Finished difference Result 1147 states and 2464 transitions. [2023-12-02 19:30:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:30:42,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-12-02 19:30:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:42,400 INFO L225 Difference]: With dead ends: 1147 [2023-12-02 19:30:42,400 INFO L226 Difference]: Without dead ends: 1147 [2023-12-02 19:30:42,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:30:42,401 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:42,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 19 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:30:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2023-12-02 19:30:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1144. [2023-12-02 19:30:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1133 states have (on average 2.172109443954104) internal successors, (2461), 1143 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2461 transitions. [2023-12-02 19:30:42,424 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2461 transitions. Word has length 25 [2023-12-02 19:30:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:42,425 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 2461 transitions. [2023-12-02 19:30:42,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2461 transitions. [2023-12-02 19:30:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 19:30:42,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:42,427 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:42,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 19:30:42,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:42,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1484358863, now seen corresponding path program 1 times [2023-12-02 19:30:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:42,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330831908] [2023-12-02 19:30:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:42,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330831908] [2023-12-02 19:30:42,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330831908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:42,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697280702] [2023-12-02 19:30:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:42,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:42,929 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:42,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 19:30:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:43,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 19:30:43,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:43,077 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:30:43,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:30:43,233 INFO L378 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 15 treesize of output 1 [2023-12-02 19:30:43,276 INFO L378 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 13 [2023-12-02 19:30:43,304 INFO L378 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 13 [2023-12-02 19:30:43,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:43,328 INFO L378 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 13 [2023-12-02 19:30:43,364 INFO L378 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 26 treesize of output 20 [2023-12-02 19:30:43,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 30 treesize of output 22 [2023-12-02 19:30:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:30:43,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:43,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_51| 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1110) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2023-12-02 19:30:43,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int) (v_ArrVal_1108 Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_51| 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1108)) |c_~#stored_elements~0.base| v_ArrVal_1110) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2023-12-02 19:30:43,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1110 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_51| Int) (v_ArrVal_1108 Int)) (or (< (+ |v_t1Thread1of1ForFork0_enqueue_~x#1_51| 2147483648) 0) (< 0 (+ (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1107))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1108))) |c_~#stored_elements~0.base| v_ArrVal_1110) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_51|)) (+ 88 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-12-02 19:30:43,532 INFO L349 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2023-12-02 19:30:43,532 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1318 treesize of output 1142 [2023-12-02 19:30:43,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:43,554 INFO L378 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 248 treesize of output 244 [2023-12-02 19:30:43,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 447 treesize of output 395 [2023-12-02 19:30:43,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 162 treesize of output 114 [2023-12-02 19:30:43,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:30:43,942 INFO L378 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 10486 treesize of output 9834 [2023-12-02 19:30:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 19:30:44,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697280702] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2110350339] [2023-12-02 19:30:44,354 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:44,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:44,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-12-02 19:30:44,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829224536] [2023-12-02 19:30:44,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 19:30:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 19:30:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=391, Unknown=3, NotChecked=126, Total=600 [2023-12-02 19:30:44,355 INFO L87 Difference]: Start difference. First operand 1144 states and 2461 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:45,086 INFO L93 Difference]: Finished difference Result 1367 states and 2870 transitions. [2023-12-02 19:30:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 19:30:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 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 25 [2023-12-02 19:30:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:45,088 INFO L225 Difference]: With dead ends: 1367 [2023-12-02 19:30:45,088 INFO L226 Difference]: Without dead ends: 1367 [2023-12-02 19:30:45,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=750, Unknown=3, NotChecked=186, Total=1190 [2023-12-02 19:30:45,089 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 458 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:45,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 222 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 583 Invalid, 0 Unknown, 466 Unchecked, 0.4s Time] [2023-12-02 19:30:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2023-12-02 19:30:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 916. [2023-12-02 19:30:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 906 states have (on average 2.123620309050773) internal successors, (1924), 915 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1924 transitions. [2023-12-02 19:30:45,103 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1924 transitions. Word has length 25 [2023-12-02 19:30:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:45,103 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1924 transitions. [2023-12-02 19:30:45,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1924 transitions. [2023-12-02 19:30:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:30:45,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:45,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:45,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 19:30:45,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 19:30:45,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:45,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1056714599, now seen corresponding path program 1 times [2023-12-02 19:30:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390362334] [2023-12-02 19:30:45,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:45,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:45,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390362334] [2023-12-02 19:30:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390362334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006120794] [2023-12-02 19:30:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:45,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:45,355 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:45,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 19:30:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:45,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:30:45,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:45,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:45,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006120794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:45,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [736768445] [2023-12-02 19:30:45,528 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:45,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:45,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-02 19:30:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453284800] [2023-12-02 19:30:45,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:45,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:30:45,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:30:45,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 19:30:45,530 INFO L87 Difference]: Start difference. First operand 916 states and 1924 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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) [2023-12-02 19:30:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:30:45,662 INFO L93 Difference]: Finished difference Result 985 states and 2020 transitions. [2023-12-02 19:30:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 19:30:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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 26 [2023-12-02 19:30:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:30:45,664 INFO L225 Difference]: With dead ends: 985 [2023-12-02 19:30:45,664 INFO L226 Difference]: Without dead ends: 985 [2023-12-02 19:30:45,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-02 19:30:45,665 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:30:45,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 76 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:30:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-12-02 19:30:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 966. [2023-12-02 19:30:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 956 states have (on average 2.0868200836820083) internal successors, (1995), 965 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1995 transitions. [2023-12-02 19:30:45,677 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1995 transitions. Word has length 26 [2023-12-02 19:30:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:30:45,677 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1995 transitions. [2023-12-02 19:30:45,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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) [2023-12-02 19:30:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1995 transitions. [2023-12-02 19:30:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:30:45,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:30:45,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:30:45,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 19:30:45,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 19:30:45,879 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:30:45,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:30:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1690911875, now seen corresponding path program 3 times [2023-12-02 19:30:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:30:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60694431] [2023-12-02 19:30:45,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:30:45,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:30:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:30:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:47,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:30:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60694431] [2023-12-02 19:30:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60694431] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:30:47,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794748253] [2023-12-02 19:30:47,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:30:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:30:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:30:47,266 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:30:47,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 19:30:47,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:30:47,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:30:47,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 19:30:47,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:30:47,437 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:30:47,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:30:47,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:47,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:30:47,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:47,465 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:30:47,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:30:47,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:47,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:47,474 INFO L378 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 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:30:47,556 INFO L378 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 43 treesize of output 34 [2023-12-02 19:30:47,620 INFO L378 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 42 [2023-12-02 19:30:47,737 INFO L378 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 49 treesize of output 36 [2023-12-02 19:30:47,816 INFO L378 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 62 treesize of output 49 [2023-12-02 19:30:47,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:47,865 INFO L378 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 53 treesize of output 38 [2023-12-02 19:30:47,906 INFO L378 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 72 treesize of output 53 [2023-12-02 19:30:48,025 INFO L378 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 92 treesize of output 69 [2023-12-02 19:30:48,381 INFO L378 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 242 treesize of output 193 [2023-12-02 19:30:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:30:48,601 INFO L378 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 521 treesize of output 432 [2023-12-02 19:30:48,875 INFO L378 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 529 treesize of output 439 [2023-12-02 19:30:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:30:49,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:30:49,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:30:49,128 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|)))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2023-12-02 19:30:49,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) (+ 88 |c_~#queue~0.offset|)) 2147483647))) (= .cse0 20)))) is different from false [2023-12-02 19:30:49,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse5 (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246))) (store .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse7 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse2 (select .cse0 .cse4)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (= .cse2 20) (< (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647)))))) is different from false [2023-12-02 19:30:49,653 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse6 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246))) (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1)))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (select .cse0 .cse5))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse2 20) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|))))))) is different from false [2023-12-02 19:30:49,695 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1))))) (let ((.cse4 (let ((.cse8 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse4 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse0 20))))))) is different from false [2023-12-02 19:30:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-02 19:30:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794748253] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:30:50,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [426762852] [2023-12-02 19:30:50,376 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:30:50,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:30:50,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 19:30:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105134790] [2023-12-02 19:30:50,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:30:50,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 19:30:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:30:50,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 19:30:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=764, Unknown=15, NotChecked=390, Total=1406 [2023-12-02 19:30:50,378 INFO L87 Difference]: Start difference. First operand 966 states and 1995 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:30:56,205 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] [2023-12-02 19:30:57,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647))) (= .cse0 20)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse6 (select .cse7 .cse2))) (or (= .cse6 20) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647))))))) is different from false [2023-12-02 19:30:57,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|)) (.cse13 (select .cse20 .cse18)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse1 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse0 (select .cse1 .cse4))) (or (= .cse0 20) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse2) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int)) (< (select (store .cse6 .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_59|) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse9 (store .cse6 .cse7 |v_t1Thread1of1ForFork0_enqueue_~x#1_61|))) (let ((.cse8 (select .cse9 .cse4))) (or (= .cse8 20) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse2) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse15 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246))) (store .cse17 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse17 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1)))))) (let ((.cse11 (let ((.cse16 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse4) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse12 (select .cse11 .cse4))) (or (< (select .cse11 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse12 20) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse11 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse2) 2147483647) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|)))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< (select (let ((.cse19 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse18 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse4)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse2) 2147483647) (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (< (select (let ((.cse21 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse21 (+ (* (select .cse21 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse2) 2147483647))))) is different from false [2023-12-02 19:30:57,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse4) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse8 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246))) (store .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse10 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 .cse3))))) (let ((.cse5 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse6 (select .cse5 .cse1))) (or (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (= .cse6 20) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse4) 2147483647)))))))) is different from false [2023-12-02 19:30:57,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_63| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246)) (.cse0 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_63|)))) (let ((.cse5 (let ((.cse7 (select (store (store .cse4 |c_~#queue~0.base| (store (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1))) |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse6 (select .cse5 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89|) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647) (= .cse6 20) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse9 (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse10 (select .cse9 .cse3))) (or (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse11 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse9 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647) (= .cse10 20)))))))) is different from false [2023-12-02 19:31:00,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse18 .cse4)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store .cse18 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647))) (= .cse0 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_63| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246)) (.cse6 (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_63|)))) (let ((.cse9 (let ((.cse11 (select (store (store .cse8 |c_~#queue~0.base| (store (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_~#queue~0.base|) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1))) |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse10 (select .cse9 .cse2))) (or (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_89|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647) (= .cse10 20) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select .cse9 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (< .cse10 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1))))) (let ((.cse16 (let ((.cse17 (select (store .cse15 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse13 (select .cse16 .cse2))) (or (< .cse13 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse14 (select (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select .cse16 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse13 20)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2023-12-02 19:31:00,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse4)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647))) (= .cse0 20)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1))))) (let ((.cse9 (let ((.cse10 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse6 (select .cse9 .cse2))) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|) (< (select (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse5) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select .cse9 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse6 20)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2023-12-02 19:31:00,697 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse11 .cse9))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (v_ArrVal_1248 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| Int) (v_ArrVal_1246 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_61| Int)) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1246))) (store .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse8 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103| 1)))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1248) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_61|)))) (let ((.cse2 (select .cse0 .cse5))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87|) (= .cse2 20) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_103|) (< (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_87| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|)))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_59| Int) (v_ArrVal_1252 (Array Int Int))) (or (< (select (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100| 1))) |c_~#stored_elements~0.base| v_ArrVal_1252) |c_~#queue~0.base|))) (store .cse10 (+ (* 4 (select .cse10 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_59|)) .cse1) 2147483647) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_100|))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20))))) is different from false [2023-12-02 19:31:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:02,652 INFO L93 Difference]: Finished difference Result 1845 states and 3789 transitions. [2023-12-02 19:31:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 19:31:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 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 28 [2023-12-02 19:31:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:02,654 INFO L225 Difference]: With dead ends: 1845 [2023-12-02 19:31:02,654 INFO L226 Difference]: Without dead ends: 1845 [2023-12-02 19:31:02,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=499, Invalid=1596, Unknown=27, NotChecked=1300, Total=3422 [2023-12-02 19:31:02,656 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 432 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 80 mSolverCounterUnsat, 102 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 4627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 102 IncrementalHoareTripleChecker+Unknown, 3419 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:02,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 388 Invalid, 4627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1026 Invalid, 102 Unknown, 3419 Unchecked, 9.3s Time] [2023-12-02 19:31:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2023-12-02 19:31:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1277. [2023-12-02 19:31:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1267 states have (on average 2.1018153117600633) internal successors, (2663), 1276 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 2663 transitions. [2023-12-02 19:31:02,676 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 2663 transitions. Word has length 28 [2023-12-02 19:31:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:02,676 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 2663 transitions. [2023-12-02 19:31:02,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 2663 transitions. [2023-12-02 19:31:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 19:31:02,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:31:02,678 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:31:02,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-02 19:31:02,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 19:31:02,878 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:31:02,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:31:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1418874381, now seen corresponding path program 4 times [2023-12-02 19:31:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:31:02,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858406345] [2023-12-02 19:31:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:02,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:31:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:04,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:31:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858406345] [2023-12-02 19:31:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858406345] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:31:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396977405] [2023-12-02 19:31:04,102 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:31:04,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:04,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:31:04,103 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:31:04,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 19:31:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:04,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 19:31:04,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:04,252 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:31:04,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:31:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:04,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:31:04,271 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 19:31:04,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2023-12-02 19:31:04,348 INFO L378 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 43 treesize of output 34 [2023-12-02 19:31:04,413 INFO L378 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 42 [2023-12-02 19:31:04,543 INFO L378 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 62 treesize of output 49 [2023-12-02 19:31:04,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:04,603 INFO L378 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 53 treesize of output 38 [2023-12-02 19:31:04,649 INFO L378 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 72 treesize of output 53 [2023-12-02 19:31:04,779 INFO L378 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 92 treesize of output 69 [2023-12-02 19:31:04,965 INFO L378 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 222 treesize of output 175 [2023-12-02 19:31:05,253 INFO L378 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 242 treesize of output 193 [2023-12-02 19:31:05,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:05,479 INFO L378 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 521 treesize of output 432 [2023-12-02 19:31:05,758 INFO L378 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 529 treesize of output 439 [2023-12-02 19:31:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:06,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:06,567 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|)))) is different from false [2023-12-02 19:31:06,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334))) (let ((.cse2 (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|))))) is different from false [2023-12-02 19:31:06,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|)))) is different from false [2023-12-02 19:31:06,636 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse2 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse3) 2147483647) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|)))))) is different from false [2023-12-02 19:31:06,685 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1331))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse4 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse1) 2147483647) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|)))))) is different from false [2023-12-02 19:31:06,708 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1331))) (let ((.cse0 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select (let ((.cse2 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse5 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse1) 2147483647) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|))))))) is different from false [2023-12-02 19:31:06,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| 1))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1331))) (let ((.cse5 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse3 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113|)))))))) is different from false [2023-12-02 19:31:06,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| 1))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1331))) (let ((.cse5 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|) (< (select (let ((.cse2 (select (store (store (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse4) 2147483647) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113|)))))))) is different from false [2023-12-02 19:31:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-12-02 19:31:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396977405] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:31:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384006269] [2023-12-02 19:31:11,159 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:31:11,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:31:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36 [2023-12-02 19:31:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514483525] [2023-12-02 19:31:11,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:31:11,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 19:31:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:31:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 19:31:11,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=672, Unknown=10, NotChecked=504, Total=1406 [2023-12-02 19:31:11,161 INFO L87 Difference]: Start difference. First operand 1277 states and 2663 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:14,343 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| 1))))) (let ((.cse8 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1331))) (let ((.cse5 (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|)))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse3 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse4) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select .cse6 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113|)))))))) (forall ((v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (< (select (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse4) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334))) (let ((.cse13 (select .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select (let ((.cse11 (select (store (store .cse12 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse4) 2147483647) (< (select .cse13 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|))))))) is different from false [2023-12-02 19:31:14,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_97| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| Int) (v_ArrVal_1336 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_67| Int) (v_ArrVal_1334 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_69| Int) (v_ArrVal_1331 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_65| Int)) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_69|)))) (let ((.cse5 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_97| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113| 1))) |c_~#stored_elements~0.base| v_ArrVal_1331) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_67|)))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1331) |c_~#queue~0.base| (store .cse5 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base|))) (or (< (select (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1334) |c_~#queue~0.base| (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110| 1))) |c_~#stored_elements~0.base| v_ArrVal_1336) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_65|)) .cse2) 2147483647) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_95|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_110|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_97|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_113|)))))))) is different from false [2023-12-02 19:31:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:15,279 INFO L93 Difference]: Finished difference Result 1669 states and 3492 transitions. [2023-12-02 19:31:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 19:31:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 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 28 [2023-12-02 19:31:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:15,281 INFO L225 Difference]: With dead ends: 1669 [2023-12-02 19:31:15,281 INFO L226 Difference]: Without dead ends: 1669 [2023-12-02 19:31:15,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=424, Invalid=1243, Unknown=13, NotChecked=870, Total=2550 [2023-12-02 19:31:15,283 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 262 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 45 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 3247 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 368 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 715 Invalid, 40 Unknown, 3247 Unchecked, 1.7s Time] [2023-12-02 19:31:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2023-12-02 19:31:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1288. [2023-12-02 19:31:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1278 states have (on average 2.1071987480438183) internal successors, (2693), 1287 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2693 transitions. [2023-12-02 19:31:15,300 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2693 transitions. Word has length 28 [2023-12-02 19:31:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:15,300 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 2693 transitions. [2023-12-02 19:31:15,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2693 transitions. [2023-12-02 19:31:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 19:31:15,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:31:15,302 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:31:15,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 19:31:15,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-02 19:31:15,502 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:31:15,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:31:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -602692015, now seen corresponding path program 3 times [2023-12-02 19:31:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:31:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596123049] [2023-12-02 19:31:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:31:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:16,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:31:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596123049] [2023-12-02 19:31:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596123049] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:31:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33052195] [2023-12-02 19:31:16,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:31:16,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:31:16,344 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:31:16,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 19:31:16,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:31:16,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:31:16,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 19:31:16,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:16,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:31:16,516 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-12-02 19:31:16,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 19:31:16,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,531 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-12-02 19:31:16,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 19:31:16,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-02 19:31:16,616 INFO L378 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 43 treesize of output 34 [2023-12-02 19:31:16,677 INFO L378 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 38 treesize of output 31 [2023-12-02 19:31:16,783 INFO L378 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 44 [2023-12-02 19:31:16,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:16,826 INFO L378 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 33 [2023-12-02 19:31:16,867 INFO L378 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 65 treesize of output 48 [2023-12-02 19:31:16,971 INFO L378 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 72 treesize of output 53 [2023-12-02 19:31:17,235 INFO L378 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 151 treesize of output 118 [2023-12-02 19:31:19,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:19,396 INFO L378 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 291 treesize of output 242 [2023-12-02 19:31:21,530 INFO L378 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 291 treesize of output 242 [2023-12-02 19:31:23,720 INFO L378 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 310 treesize of output 257 [2023-12-02 19:31:30,154 INFO L378 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 905 treesize of output 758 [2023-12-02 19:31:36,602 INFO L378 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 897 treesize of output 751 [2023-12-02 19:31:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:36,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:36,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:31:36,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:31:36,881 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1)) 2147483647)) is different from false [2023-12-02 19:31:36,893 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1)) 2147483647))) is different from false [2023-12-02 19:31:37,088 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (= .cse3 20)))))) is different from false [2023-12-02 19:31:37,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse6 (select .cse5 .cse3))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|) (< (select (let ((.cse2 (select (store (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse3) 2147483647) (= 20 .cse6))))))) is different from false [2023-12-02 19:31:37,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))))) (let ((.cse6 (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse0 (select .cse6 .cse4))) (or (= .cse0 20) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|) (< (select (let ((.cse3 (select (store (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse4) 2147483647))))))) is different from false [2023-12-02 19:31:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-12-02 19:31:37,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33052195] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:31:37,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312257866] [2023-12-02 19:31:37,513 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:31:37,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:31:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 37 [2023-12-02 19:31:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211806058] [2023-12-02 19:31:37,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:31:37,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 19:31:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:31:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 19:31:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=766, Unknown=18, NotChecked=462, Total=1482 [2023-12-02 19:31:37,516 INFO L87 Difference]: Start difference. First operand 1288 states and 2693 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:43,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse2 .cse3))) (let ((.cse4 (+ .cse5 1)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647))) (or (= .cse5 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647))))))) is different from false [2023-12-02 19:31:47,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (= .cse4 20))))) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse9 (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_75|)))) (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse6 (select .cse8 .cse1))) (or (= .cse6 20) (< (select (let ((.cse7 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| 1)) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|)))))))) is different from false [2023-12-02 19:31:48,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse14 .cse15)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse2 (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse4 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (= .cse4 20))))) (< .cse6 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse10 (let ((.cse12 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_75|)))) (let ((.cse9 (let ((.cse11 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse7 (select .cse9 .cse1))) (or (= .cse7 20) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| 1)) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (< (select .cse10 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|)))))) (or (= .cse6 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse13 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse15 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647)))))) is different from false [2023-12-02 19:31:49,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse9))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse13 (+ .cse0 1)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))))) (let ((.cse4 (let ((.cse7 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse6 (select .cse4 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|) (< (select (let ((.cse1 (select (store (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse2) 2147483647) (= 20 .cse6)))))) (not (= |c_~#queue~0.base| 4)) (= |c_~#queue~0.offset| 0) (let ((.cse10 (= |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 .cse10) (<= (select .cse11 84) 2)) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 84) 2) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) .cse10 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|))))) (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse12 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse17 (store .cse11 (+ (* (select .cse11 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_75|))) (let ((.cse16 (let ((.cse18 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse17 .cse5 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse14 (select .cse16 .cse2))) (or (= .cse14 20) (< (select (let ((.cse15 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse16 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| 1)) .cse2 (+ .cse14 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse2) 2147483647) (< (select .cse17 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|)))))) (<= .cse0 2) (or (= .cse0 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse19 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 .cse13)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* 4 (select .cse19 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse2) 2147483647))))))) is different from false [2023-12-02 19:31:50,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:31:51,355 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse4 .cse5))) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ .cse13 1)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (not (= |c_~#queue~0.base| 4)) (= |c_~#queue~0.offset| 0) (let ((.cse0 (= |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 .cse0) (<= (select .cse1 84) 2)) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|) 84) 2) (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 84)) .cse0 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|))))) (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse3) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_75| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse11 (store .cse1 (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_75|)) (.cse10 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse11 .cse10 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124| 1))) |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse7 (select .cse9 .cse3))) (or (= .cse7 20) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_106| 1)) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse3) 2147483647) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_124|)))))) (<= .cse13 2) (or (= .cse13 20) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse14 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 .cse6)) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* 4 (select .cse14 .cse3))) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse3) 2147483647))))))) is different from false [2023-12-02 19:31:51,575 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse3)) 2147483647)))) is different from false [2023-12-02 19:31:51,664 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse4 (select .cse3 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (= .cse4 20))))))) is different from false [2023-12-02 19:31:51,669 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2147483646) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1)) 2147483647))) is different from false [2023-12-02 19:31:52,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int) (v_ArrVal_1419 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_73| Int)) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1419) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_73|)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647) (= .cse3 20))))) (forall ((v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_71| Int)) (< (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1424) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_71|)) .cse1) 2147483647)))) is different from false [2023-12-02 19:31:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:31:53,811 INFO L93 Difference]: Finished difference Result 2590 states and 5373 transitions. [2023-12-02 19:31:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 19:31:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 19:31:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:31:53,814 INFO L225 Difference]: With dead ends: 2590 [2023-12-02 19:31:53,814 INFO L226 Difference]: Without dead ends: 2590 [2023-12-02 19:31:53,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 16 IntricatePredicates, 2 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=1107, Invalid=3271, Unknown=108, NotChecked=2320, Total=6806 [2023-12-02 19:31:53,817 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 669 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 134 mSolverCounterUnsat, 86 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 6440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 86 IncrementalHoareTripleChecker+Unknown, 5004 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:31:53,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 517 Invalid, 6440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1216 Invalid, 86 Unknown, 5004 Unchecked, 5.7s Time] [2023-12-02 19:31:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2023-12-02 19:31:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 1452. [2023-12-02 19:31:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1442 states have (on average 2.187239944521498) internal successors, (3154), 1451 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 3154 transitions. [2023-12-02 19:31:53,845 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 3154 transitions. Word has length 31 [2023-12-02 19:31:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:31:53,845 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 3154 transitions. [2023-12-02 19:31:53,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 38 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 3154 transitions. [2023-12-02 19:31:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 19:31:53,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:31:53,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:31:53,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 19:31:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:54,047 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:31:54,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:31:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1097226554, now seen corresponding path program 1 times [2023-12-02 19:31:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:31:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80103731] [2023-12-02 19:31:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:31:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:54,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:31:54,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80103731] [2023-12-02 19:31:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80103731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:31:54,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10407266] [2023-12-02 19:31:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:31:54,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:31:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:31:54,755 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:31:54,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 19:31:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:31:54,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-02 19:31:54,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:31:54,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:54,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:31:54,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:31:54,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2023-12-02 19:31:55,047 INFO L378 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 39 treesize of output 35 [2023-12-02 19:31:55,113 INFO L378 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 40 treesize of output 38 [2023-12-02 19:31:55,225 INFO L378 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 46 treesize of output 40 [2023-12-02 19:31:55,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 19:31:55,323 INFO L378 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 41 [2023-12-02 19:31:55,391 INFO L378 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 49 treesize of output 38 [2023-12-02 19:31:55,508 INFO L378 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 38 [2023-12-02 19:31:55,552 INFO L378 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 42 treesize of output 31 [2023-12-02 19:31:55,604 INFO L378 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 61 treesize of output 46 [2023-12-02 19:31:55,659 INFO L378 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 56 treesize of output 43 [2023-12-02 19:31:55,664 INFO L378 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 48 treesize of output 36 [2023-12-02 19:31:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:31:55,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:31:55,840 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_79| Int) (v_ArrVal_1520 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1520) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_79|)) .cse1)) 20))) is different from false [2023-12-02 19:31:55,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_79| Int) (v_ArrVal_1520 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1520) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_79|)) .cse1)) 20))) is different from false [2023-12-02 19:31:55,865 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_79| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1520 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1520) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_79|)) .cse1)) 20))) is different from false [2023-12-02 19:31:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 19:31:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10407266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:31:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [871478694] [2023-12-02 19:31:56,531 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:31:56,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:31:56,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2023-12-02 19:31:56,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589746216] [2023-12-02 19:31:56,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:31:56,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 19:31:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:31:56,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 19:31:56,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=823, Unknown=8, NotChecked=192, Total=1260 [2023-12-02 19:31:56,532 INFO L87 Difference]: Start difference. First operand 1452 states and 3154 transitions. Second operand has 36 states, 36 states have (on average 2.5) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:31:59,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_79| Int) (v_ArrVal_1520 (Array Int Int))) (not (= (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1520) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_79|)) .cse1) 20))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_79| Int)) (not (= (select (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_79|)) .cse1) 20))))) is different from false [2023-12-02 19:32:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:32:00,509 INFO L93 Difference]: Finished difference Result 2125 states and 4520 transitions. [2023-12-02 19:32:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 19:32:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2023-12-02 19:32:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:32:00,512 INFO L225 Difference]: With dead ends: 2125 [2023-12-02 19:32:00,512 INFO L226 Difference]: Without dead ends: 2125 [2023-12-02 19:32:00,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 12 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=617, Invalid=2252, Unknown=9, NotChecked=428, Total=3306 [2023-12-02 19:32:00,514 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 309 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 881 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:32:00,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 407 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1200 Invalid, 2 Unknown, 881 Unchecked, 2.1s Time] [2023-12-02 19:32:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2023-12-02 19:32:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1807. [2023-12-02 19:32:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1797 states have (on average 2.1619365609348913) internal successors, (3885), 1806 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) [2023-12-02 19:32:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 3885 transitions. [2023-12-02 19:32:00,548 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 3885 transitions. Word has length 34 [2023-12-02 19:32:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:32:00,548 INFO L495 AbstractCegarLoop]: Abstraction has 1807 states and 3885 transitions. [2023-12-02 19:32:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 3885 transitions. [2023-12-02 19:32:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:32:00,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:32:00,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:32:00,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 19:32:00,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:00,751 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:32:00,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:32:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -681747738, now seen corresponding path program 1 times [2023-12-02 19:32:00,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:32:00,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950549909] [2023-12-02 19:32:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:00,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:32:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:02,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:32:02,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950549909] [2023-12-02 19:32:02,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950549909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:02,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386482434] [2023-12-02 19:32:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:02,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:02,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:32:02,360 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:32:02,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 19:32:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:02,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-02 19:32:02,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:32:02,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:32:02,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,599 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-12-02 19:32:02,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 19:32:02,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-02 19:32:02,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 19:32:02,709 INFO L378 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 43 treesize of output 34 [2023-12-02 19:32:02,764 INFO L378 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 38 treesize of output 31 [2023-12-02 19:32:02,865 INFO L378 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 44 treesize of output 33 [2023-12-02 19:32:02,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:02,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 19:32:02,925 INFO L378 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 41 [2023-12-02 19:32:02,992 INFO L378 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 49 treesize of output 38 [2023-12-02 19:32:03,110 INFO L378 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 38 [2023-12-02 19:32:03,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:03,152 INFO L378 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 42 treesize of output 31 [2023-12-02 19:32:03,204 INFO L378 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 61 treesize of output 46 [2023-12-02 19:32:03,257 INFO L378 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 48 treesize of output 36 [2023-12-02 19:32:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:03,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:32:03,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse2)) 20)))))) is different from false [2023-12-02 19:32:03,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1) 20)) (= 20 .cse4)))))) is different from false [2023-12-02 19:32:04,013 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_130| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse3 (let ((.cse5 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_130| 1)) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1) 20)) (= .cse4 20)))))) is different from false [2023-12-02 19:32:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-02 19:32:04,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386482434] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:32:04,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782940351] [2023-12-02 19:32:04,458 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:32:04,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:32:04,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 42 [2023-12-02 19:32:04,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016803850] [2023-12-02 19:32:04,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:32:04,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 19:32:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:32:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 19:32:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1231, Unknown=50, NotChecked=234, Total=1806 [2023-12-02 19:32:04,461 INFO L87 Difference]: Start difference. First operand 1807 states and 3885 transitions. Second operand has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:08,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse16 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse18 (select .cse2 .cse3))) (let ((.cse4 (+ .cse18 1)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse17 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|)) (.cse6 (= .cse18 20))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= 20 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1)))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) (forall ((v_ArrVal_1621 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= 20 (select (let ((.cse5 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1)))) (or .cse6 (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= (select (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse4)) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1) 20)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse10 (let ((.cse12 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1617) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_89|)))) (let ((.cse8 (select .cse10 .cse1))) (or (= .cse8 20) (not (= (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse10 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1) 20)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_89| Int) (v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (let ((.cse15 (store .cse16 .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_89|))) (let ((.cse13 (select .cse15 .cse1))) (or (= .cse13 20) (not (= (select (let ((.cse14 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse15 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1) 20)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= 20 (select (store .cse16 .cse17 |v_t1Thread1of1ForFork0_enqueue_~x#1_87|) .cse1)))) (not .cse6))))) is different from false [2023-12-02 19:32:08,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (let ((.cse0 (= .cse5 20))) (and (or .cse0 (forall ((v_ArrVal_1621 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse2)) 20)))) (not .cse0))))) is different from false [2023-12-02 19:32:08,755 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20))) (and (or (forall ((v_ArrVal_1621 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_87| Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1621) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_87|)) .cse1))))) .cse4) (not .cse4))) is different from false [2023-12-02 19:32:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:32:10,199 INFO L93 Difference]: Finished difference Result 3132 states and 6575 transitions. [2023-12-02 19:32:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-02 19:32:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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 35 [2023-12-02 19:32:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:32:10,204 INFO L225 Difference]: With dead ends: 3132 [2023-12-02 19:32:10,204 INFO L226 Difference]: Without dead ends: 3132 [2023-12-02 19:32:10,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=922, Invalid=3723, Unknown=71, NotChecked=834, Total=5550 [2023-12-02 19:32:10,207 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 715 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 84 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 1683 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:32:10,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 538 Invalid, 3759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1962 Invalid, 30 Unknown, 1683 Unchecked, 3.4s Time] [2023-12-02 19:32:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states. [2023-12-02 19:32:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 2337. [2023-12-02 19:32:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2327 states have (on average 2.172754619681994) internal successors, (5056), 2336 states have internal predecessors, (5056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 5056 transitions. [2023-12-02 19:32:10,261 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 5056 transitions. Word has length 35 [2023-12-02 19:32:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:32:10,261 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 5056 transitions. [2023-12-02 19:32:10,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 5056 transitions. [2023-12-02 19:32:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 19:32:10,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:32:10,264 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:32:10,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 19:32:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:10,465 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:32:10,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:32:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1597719888, now seen corresponding path program 2 times [2023-12-02 19:32:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:32:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786787435] [2023-12-02 19:32:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:32:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:11,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:32:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786787435] [2023-12-02 19:32:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786787435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822295903] [2023-12-02 19:32:11,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:32:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:11,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:32:11,681 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:32:11,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 19:32:12,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:32:12,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:32:12,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-02 19:32:12,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:32:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:32:12,194 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:32:12,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:32:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:32:12,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:32:12,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2023-12-02 19:32:12,327 INFO L378 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 43 treesize of output 34 [2023-12-02 19:32:12,393 INFO L378 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 38 treesize of output 31 [2023-12-02 19:32:12,540 INFO L378 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 44 treesize of output 33 [2023-12-02 19:32:12,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 19:32:12,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 19:32:12,660 INFO L378 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 41 [2023-12-02 19:32:12,740 INFO L378 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 49 treesize of output 38 [2023-12-02 19:32:12,877 INFO L378 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 38 [2023-12-02 19:32:12,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:12,931 INFO L378 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 42 treesize of output 31 [2023-12-02 19:32:12,990 INFO L378 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 61 treesize of output 46 [2023-12-02 19:32:13,078 INFO L378 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 48 treesize of output 36 [2023-12-02 19:32:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:13,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:32:13,233 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1)) 20))) is different from false [2023-12-02 19:32:13,349 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1))))) is different from false [2023-12-02 19:32:13,359 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1))))) is different from false [2023-12-02 19:32:13,816 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_97| Int) (v_ArrVal_1717 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1717))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_97|)))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1)) 20))) is different from false [2023-12-02 19:32:13,835 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_97| Int) (v_ArrVal_1717 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1717))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (let ((.cse4 (select .cse2 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* 4 (select .cse4 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_97|)))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1)) 20))) is different from false [2023-12-02 19:32:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-02 19:32:14,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822295903] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:32:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1078865210] [2023-12-02 19:32:14,267 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:32:14,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:32:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 41 [2023-12-02 19:32:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164335388] [2023-12-02 19:32:14,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:32:14,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 19:32:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:32:14,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 19:32:14,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1123, Unknown=28, NotChecked=370, Total=1722 [2023-12-02 19:32:14,270 INFO L87 Difference]: Start difference. First operand 2337 states and 5056 transitions. Second operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:20,852 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= 20 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1)))) (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_97| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= 20 (select (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_97|)))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1)))) (not (= .cse4 20))))) is different from false [2023-12-02 19:32:21,021 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((v_ArrVal_1722 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_95| Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1722) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_95|)) .cse1))))) (not (= .cse4 20))))) is different from false [2023-12-02 19:32:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:32:22,151 INFO L93 Difference]: Finished difference Result 3287 states and 6941 transitions. [2023-12-02 19:32:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 19:32:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 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 35 [2023-12-02 19:32:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:32:22,155 INFO L225 Difference]: With dead ends: 3287 [2023-12-02 19:32:22,155 INFO L226 Difference]: Without dead ends: 3287 [2023-12-02 19:32:22,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 70 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=702, Invalid=3441, Unknown=45, NotChecked=924, Total=5112 [2023-12-02 19:32:22,156 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 706 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 146 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 2183 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 19:32:22,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 374 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1885 Invalid, 74 Unknown, 2183 Unchecked, 3.5s Time] [2023-12-02 19:32:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2023-12-02 19:32:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2440. [2023-12-02 19:32:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2430 states have (on average 2.1979423868312757) internal successors, (5341), 2439 states have internal predecessors, (5341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 5341 transitions. [2023-12-02 19:32:22,207 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 5341 transitions. Word has length 35 [2023-12-02 19:32:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:32:22,207 INFO L495 AbstractCegarLoop]: Abstraction has 2440 states and 5341 transitions. [2023-12-02 19:32:22,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:32:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 5341 transitions. [2023-12-02 19:32:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 19:32:22,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:32:22,211 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:32:22,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 19:32:22,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:22,411 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:32:22,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:32:22,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1540035112, now seen corresponding path program 5 times [2023-12-02 19:32:22,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:32:22,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760640854] [2023-12-02 19:32:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:32:22,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:32:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:32:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:24,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:32:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760640854] [2023-12-02 19:32:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760640854] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:32:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367950751] [2023-12-02 19:32:24,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:32:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:32:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:32:24,262 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:32:24,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 19:32:24,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 19:32:24,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:32:24,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 96 conjunts are in the unsatisfiable core [2023-12-02 19:32:24,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:32:24,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:24,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:24,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:32:24,803 INFO L349 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2023-12-02 19:32:24,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 67 [2023-12-02 19:32:24,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:24,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:32:24,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:24,848 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2023-12-02 19:32:24,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 44 treesize of output 1 [2023-12-02 19:32:24,996 INFO L378 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 43 treesize of output 34 [2023-12-02 19:32:25,115 INFO L378 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 42 [2023-12-02 19:32:25,383 INFO L378 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 62 treesize of output 49 [2023-12-02 19:32:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:25,480 INFO L378 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 53 treesize of output 38 [2023-12-02 19:32:25,598 INFO L378 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 72 treesize of output 53 [2023-12-02 19:32:25,795 INFO L378 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 92 treesize of output 69 [2023-12-02 19:32:26,313 INFO L378 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 242 treesize of output 193 [2023-12-02 19:32:26,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:26,602 INFO L378 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 521 treesize of output 432 [2023-12-02 19:32:26,823 INFO L378 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 540 treesize of output 447 [2023-12-02 19:32:27,642 INFO L378 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 2085 treesize of output 1780 [2023-12-02 19:32:32,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8234 treesize of output 6935 [2023-12-02 19:32:35,569 INFO L378 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 8247 treesize of output 6948 [2023-12-02 19:32:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:32:45,156 INFO L378 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 23827 treesize of output 20080 [2023-12-02 19:32:56,786 INFO L378 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 23835 treesize of output 20087 [2023-12-02 19:32:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:32:57,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:32:57,755 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:32:57,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-12-02 19:32:57,781 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse1 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1)))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 19:32:57,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-12-02 19:32:58,096 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|))))) is different from false [2023-12-02 19:32:58,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse0 (let ((.cse6 (select .cse5 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|))) (.cse2 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse3 (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse5 |c_~#queue~0.base| (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647)))))) is different from false [2023-12-02 19:32:58,171 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse2 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|))) (.cse7 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse4 (select (store (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse7) 2147483647) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))))) is different from false [2023-12-02 19:32:58,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse2 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|))) (.cse7 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse4 (select (store (store (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse7) 2147483647) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))))) is different from false [2023-12-02 19:33:00,733 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (v_ArrVal_1819 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|))) (.cse3 (+ 88 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse3) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|)))))) is different from false [2023-12-02 19:33:01,056 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1826 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| 1))))) (let ((.cse4 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select (let ((.cse6 (select (store (store (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse1) 2147483647) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|))))))) is different from false [2023-12-02 19:33:01,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1826 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse8 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174|) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse5 (select (store (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse0 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse4) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|))))))) is different from false [2023-12-02 19:33:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2023-12-02 19:33:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367950751] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:33:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1035124397] [2023-12-02 19:33:06,118 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 19:33:06,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:33:06,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 18] total 49 [2023-12-02 19:33:06,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128616744] [2023-12-02 19:33:06,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:33:06,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 19:33:06,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:33:06,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 19:33:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1255, Unknown=28, NotChecked=946, Total=2550 [2023-12-02 19:33:06,121 INFO L87 Difference]: Start difference. First operand 2440 states and 5341 transitions. Second operand has 51 states, 50 states have (on average 2.18) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:33:10,822 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] [2023-12-02 19:33:17,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:33:21,586 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] [2023-12-02 19:33:23,646 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] [2023-12-02 19:33:25,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] [2023-12-02 19:33:27,705 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] [2023-12-02 19:33:34,578 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] [2023-12-02 19:33:37,949 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] [2023-12-02 19:33:40,209 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] [2023-12-02 19:33:49,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:34:02,466 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] [2023-12-02 19:34:04,493 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] [2023-12-02 19:34:19,489 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] [2023-12-02 19:34:21,503 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] [2023-12-02 19:34:23,896 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] [2023-12-02 19:34:26,758 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] [2023-12-02 19:34:28,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:34:30,782 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] [2023-12-02 19:34:32,917 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] [2023-12-02 19:34:35,536 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] [2023-12-02 19:34:37,755 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] [2023-12-02 19:34:39,811 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] [2023-12-02 19:34:41,827 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] [2023-12-02 19:34:52,584 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] [2023-12-02 19:34:54,645 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] [2023-12-02 19:34:56,669 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] [2023-12-02 19:34:58,934 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] [2023-12-02 19:35:00,944 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] [2023-12-02 19:35:19,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:35:21,144 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] [2023-12-02 19:35:23,226 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] [2023-12-02 19:35:25,326 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] [2023-12-02 19:35:27,342 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] [2023-12-02 19:35:29,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:35:31,391 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] [2023-12-02 19:35:33,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:35:35,474 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] [2023-12-02 19:35:37,500 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] [2023-12-02 19:35:46,597 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] [2023-12-02 19:35:48,627 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] [2023-12-02 19:35:50,645 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] [2023-12-02 19:36:07,148 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] [2023-12-02 19:36:09,190 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] [2023-12-02 19:36:11,211 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] [2023-12-02 19:36:34,023 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] [2023-12-02 19:36:36,032 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] [2023-12-02 19:36:38,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 [0] [2023-12-02 19:36:40,087 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] [2023-12-02 19:36:42,125 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] [2023-12-02 19:36:44,164 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] [2023-12-02 19:36:46,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:36:48,218 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] [2023-12-02 19:36:50,247 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] [2023-12-02 19:36:52,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:36:54,280 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] [2023-12-02 19:36:56,311 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] [2023-12-02 19:36:58,321 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] [2023-12-02 19:37:00,388 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] [2023-12-02 19:37:02,409 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] [2023-12-02 19:37:04,487 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] [2023-12-02 19:37:06,512 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] [2023-12-02 19:37:22,962 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] [2023-12-02 19:37:24,999 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] [2023-12-02 19:37:27,010 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] [2023-12-02 19:37:29,033 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] [2023-12-02 19:37:31,143 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] [2023-12-02 19:37:33,169 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] [2023-12-02 19:37:35,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:37:37,825 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] [2023-12-02 19:37:39,843 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] [2023-12-02 19:37:41,858 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] [2023-12-02 19:37:43,902 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] [2023-12-02 19:37:45,921 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] [2023-12-02 19:37:47,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:37:49,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] [2023-12-02 19:37:51,992 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] [2023-12-02 19:37:54,006 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] [2023-12-02 19:37:56,042 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] [2023-12-02 19:37:58,068 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] [2023-12-02 19:38:00,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:38:02,115 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] [2023-12-02 19:38:04,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] [2023-12-02 19:38:06,153 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] [2023-12-02 19:38:08,186 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] [2023-12-02 19:38:10,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:38:12,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:38:14,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:38:16,291 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] [2023-12-02 19:38:18,721 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] [2023-12-02 19:38:20,734 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] [2023-12-02 19:38:44,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:38:46,459 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] [2023-12-02 19:38:48,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:38:50,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:38:52,636 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] [2023-12-02 19:38:54,656 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] [2023-12-02 19:38:57,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] [2023-12-02 19:39:27,123 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] [2023-12-02 19:39:29,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:39:32,671 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] [2023-12-02 19:39:34,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] [2023-12-02 19:39:36,730 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] [2023-12-02 19:39:38,774 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] [2023-12-02 19:39:40,793 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] [2023-12-02 19:40:14,361 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] [2023-12-02 19:40:16,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] [2023-12-02 19:40:19,462 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] [2023-12-02 19:40:49,159 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] [2023-12-02 19:41:27,137 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] [2023-12-02 19:41:29,166 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] [2023-12-02 19:41:31,617 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] [2023-12-02 19:41:33,777 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] [2023-12-02 19:41:35,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:41:37,958 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] [2023-12-02 19:41:40,011 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] [2023-12-02 19:41:42,266 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] [2023-12-02 19:41:44,524 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] [2023-12-02 19:41:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 19:41:48,594 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] [2023-12-02 19:41:50,633 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] [2023-12-02 19:41:52,669 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] [2023-12-02 19:41:54,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] [2023-12-02 19:41:57,695 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] [2023-12-02 19:41:59,712 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] [2023-12-02 19:42:01,771 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] [2023-12-02 19:42:07,007 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] [2023-12-02 19:42:09,040 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] [2023-12-02 19:42:11,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:42:13,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:42:15,095 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] [2023-12-02 19:42:15,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse13 .cse6)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1)))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1819 (Array Int Int)) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1826 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174| 1))))) (let ((.cse8 (let ((.cse12 (select (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|)))) (let ((.cse7 (let ((.cse11 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse8 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_174|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select (let ((.cse9 (select (store (store (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store .cse10 |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse7 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|)))))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse17 (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse14 (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse14 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse15 (select (store (store (store .cse16 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse17 |c_~#queue~0.base| (store .cse14 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647) (< (select .cse14 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))))))) is different from false [2023-12-02 19:42:17,688 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] [2023-12-02 19:42:19,744 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] [2023-12-02 19:42:21,769 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] [2023-12-02 19:42:23,784 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] [2023-12-02 19:42:25,820 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] [2023-12-02 19:42:27,839 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] [2023-12-02 19:42:28,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 .cse4)))) (and (forall ((v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (< (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (v_ArrVal_1819 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse9 (let ((.cse11 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|)))) (let ((.cse8 (let ((.cse10 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse9 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select (let ((.cse6 (select (store (store (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse8 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647) (< (select .cse9 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|) (< (select .cse9 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse8 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse14 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse12 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse12 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse12 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse13 (select (store (store (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse14 |c_~#queue~0.base| (store .cse12 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647)))))))) is different from false [2023-12-02 19:42:30,753 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] [2023-12-02 19:42:32,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:42:32,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (v_ArrVal_1819 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse5 (let ((.cse7 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|)))) (let ((.cse3 (let ((.cse6 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse5 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select (let ((.cse0 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse4) 2147483647) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse10 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse8 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse8 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse9 (select (store (store (store .cse2 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse10 |c_~#queue~0.base| (store .cse8 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse4) 2147483647))))))) is different from false [2023-12-02 19:42:35,043 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] [2023-12-02 19:42:37,599 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] [2023-12-02 19:42:39,619 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] [2023-12-02 19:42:41,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:42:43,721 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] [2023-12-02 19:42:43,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (v_ArrVal_1819 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse6 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1819) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|)))) (let ((.cse7 (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse7 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse7 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse1) 2147483647) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|))))))) is different from false [2023-12-02 19:42:48,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:42:49,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 19:42:52,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (select .cse16 .cse10)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| Int) (v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_105| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse2 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_105|)))) (let ((.cse0 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))) |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_152|) (< (select (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1823) |c_~#queue~0.base| (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse3) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (or (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse9) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse3) 2147483647))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse9 .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse14 (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse11 (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse11 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse12 (select (store (store (store .cse13 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse14 |c_~#queue~0.base| (store .cse11 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse3) 2147483647) (< (select .cse11 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2023-12-02 19:42:52,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse4)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse9 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse6 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse7 (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|)))))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)))) is different from false [2023-12-02 19:42:53,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse11 .cse4)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1)))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647))) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171| 1))))) (let ((.cse9 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse6 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_171|) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse7 (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|))))))))) is different from false [2023-12-02 19:42:54,263 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (and (forall ((v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (< (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647)) (forall ((v_ArrVal_1823 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3 .cse4)))) (let ((.cse9 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1823))) (let ((.cse6 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse7 (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store .cse9 |c_~#queue~0.base| (store .cse6 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse5) 2147483647)))))))) is different from false [2023-12-02 19:42:56,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_103| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_103|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150|) (< (select (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base| (store (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_150| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_~#queue~0.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* 4 (select .cse7 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) .cse2) 2147483647)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646))) is different from false [2023-12-02 19:42:56,307 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| Int) (v_ArrVal_1828 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_101| Int) (v_ArrVal_1826 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168|) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1826) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_168| 1))) |c_~#stored_elements~0.base| v_ArrVal_1828) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 (+ 84 |c_~#queue~0.offset|)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_101|)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 2147483646)) is different from false [2023-12-02 19:42:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:42:56,633 INFO L93 Difference]: Finished difference Result 3805 states and 8039 transitions. [2023-12-02 19:42:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-02 19:42:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.18) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 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 37 [2023-12-02 19:42:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:42:56,638 INFO L225 Difference]: With dead ends: 3805 [2023-12-02 19:42:56,638 INFO L226 Difference]: Without dead ends: 3805 [2023-12-02 19:42:56,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 40 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 21 IntricatePredicates, 1 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 309.6s TimeCoverageRelationStatistics Valid=1109, Invalid=3930, Unknown=157, NotChecked=3360, Total=8556 [2023-12-02 19:42:56,640 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 782 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 131 mSolverCounterUnsat, 174 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 314.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 10446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 174 IncrementalHoareTripleChecker+Unknown, 8620 IncrementalHoareTripleChecker+Unchecked, 315.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:42:56,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 649 Invalid, 10446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1521 Invalid, 174 Unknown, 8620 Unchecked, 315.7s Time] [2023-12-02 19:42:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2023-12-02 19:42:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 2522. [2023-12-02 19:42:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2512 states have (on average 2.2014331210191083) internal successors, (5530), 2521 states have internal predecessors, (5530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:42:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 5530 transitions. [2023-12-02 19:42:56,685 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 5530 transitions. Word has length 37 [2023-12-02 19:42:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:42:56,686 INFO L495 AbstractCegarLoop]: Abstraction has 2522 states and 5530 transitions. [2023-12-02 19:42:56,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.18) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:42:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 5530 transitions. [2023-12-02 19:42:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 19:42:56,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:42:56,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:42:56,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 19:42:56,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 19:42:56,889 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-12-02 19:42:56,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:42:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1629263636, now seen corresponding path program 4 times [2023-12-02 19:42:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:42:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389470046] [2023-12-02 19:42:56,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:42:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:42:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:42:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:42:58,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:42:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389470046] [2023-12-02 19:42:58,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389470046] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:42:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018922244] [2023-12-02 19:42:58,047 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 19:42:58,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:42:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:42:58,049 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:42:58,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bfd67e8-49a9-468e-9594-77affa69e146/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 19:42:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:42:58,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 88 conjunts are in the unsatisfiable core [2023-12-02 19:42:58,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:42:58,261 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 19:42:58,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 19:42:58,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-12-02 19:42:58,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-12-02 19:42:58,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,292 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 19:42:58,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 16 treesize of output 10 [2023-12-02 19:42:58,375 INFO L378 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 43 treesize of output 34 [2023-12-02 19:42:58,450 INFO L378 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 38 treesize of output 31 [2023-12-02 19:42:58,571 INFO L378 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 44 [2023-12-02 19:42:58,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:58,626 INFO L378 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 33 [2023-12-02 19:42:58,685 INFO L378 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 65 treesize of output 48 [2023-12-02 19:42:58,812 INFO L378 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 72 treesize of output 53 [2023-12-02 19:42:59,098 INFO L378 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 162 treesize of output 129 [2023-12-02 19:42:59,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:42:59,287 INFO L378 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 314 treesize of output 257 [2023-12-02 19:42:59,416 INFO L378 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 333 treesize of output 272 [2023-12-02 19:43:00,015 INFO L378 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 1185 treesize of output 1004 [2023-12-02 19:43:02,085 INFO L378 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 4417 treesize of output 3714 [2023-12-02 19:43:17,259 INFO L378 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 12705 treesize of output 10702 [2023-12-02 19:43:32,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:43:32,002 INFO L378 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 12705 treesize of output 10702 [2023-12-02 19:43:45,373 INFO L378 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 12724 treesize of output 10717