./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/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_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:47:44,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:47:44,876 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:47:44,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:47:44,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:47:44,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:47:44,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:47:44,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:47:44,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:47:44,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:47:44,906 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:47:44,906 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:47:44,907 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:47:44,907 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:47:44,908 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:47:44,908 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:47:44,909 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:47:44,909 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:47:44,909 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:47:44,910 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:47:44,910 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:47:44,911 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:47:44,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:47:44,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:47:44,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:47:44,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:47:44,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:47:44,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:47:44,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:47:44,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:47:44,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:47:44,916 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:47:44,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:47:44,917 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:47:44,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:47:44,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:47:44,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:47:44,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:47:44,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:47:44,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:47:44,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:47:44,919 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:47:44,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:47:44,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:47:44,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:47:44,920 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:47:44,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:47:44,920 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_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/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_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/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 ! call(reach_error())) ) 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2023-12-02 18:47:45,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:47:45,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:47:45,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:47:45,157 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:47:45,157 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:47:45,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2023-12-02 18:47:47,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:47:48,084 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:47:48,085 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2023-12-02 18:47:48,092 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/data/ad973432b/c6e1aaaafa8744429d151c8ffe8ee1ec/FLAG65e8ee2aa [2023-12-02 18:47:48,108 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/data/ad973432b/c6e1aaaafa8744429d151c8ffe8ee1ec [2023-12-02 18:47:48,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:47:48,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:47:48,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:47:48,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:47:48,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:47:48,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15128684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48, skipping insertion in model container [2023-12-02 18:47:48,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:47:48,330 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[3013,3026] [2023-12-02 18:47:48,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:47:48,349 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:47:48,372 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[3013,3026] [2023-12-02 18:47:48,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:47:48,384 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:47:48,385 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:47:48,393 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:47:48,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48 WrapperNode [2023-12-02 18:47:48,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:47:48,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:47:48,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:47:48,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:47:48,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,438 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 210 [2023-12-02 18:47:48,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:47:48,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:47:48,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:47:48,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:47:48,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:47:48,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:47:48,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:47:48,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:47:48,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (1/1) ... [2023-12-02 18:47:48,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:47:48,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:47:48,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:47:48,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:47:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:47:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 18:47:48,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 18:47:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 18:47:48,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 18:47:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:47:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:47:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:47:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 18:47:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 18:47:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:47:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:47:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:47:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:47:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:47:48,544 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 18:47:48,658 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:47:48,660 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:47:48,983 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:47:49,281 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:47:49,281 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 18:47:49,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:47:49 BoogieIcfgContainer [2023-12-02 18:47:49,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:47:49,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:47:49,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:47:49,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:47:49,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:47:48" (1/3) ... [2023-12-02 18:47:49,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6946a44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:47:49, skipping insertion in model container [2023-12-02 18:47:49,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:47:48" (2/3) ... [2023-12-02 18:47:49,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6946a44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:47:49, skipping insertion in model container [2023-12-02 18:47:49,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:47:49" (3/3) ... [2023-12-02 18:47:49,291 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-12-02 18:47:49,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 18:47:49,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:47:49,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:47:49,311 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 18:47:49,351 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 18:47:49,379 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 29 transitions, 72 flow [2023-12-02 18:47:49,403 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 103 states, 102 states have (on average 2.323529411764706) internal successors, (237), 102 states have internal predecessors, (237), 0 states have call successors, (0), 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 18:47:49,420 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:47:49,427 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;@7e093e01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:47:49,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-02 18:47:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 102 states have (on average 2.323529411764706) internal successors, (237), 102 states have internal predecessors, (237), 0 states have call successors, (0), 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 18:47:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 18:47:49,439 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:49,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:47:49,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:49,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1254409484, now seen corresponding path program 1 times [2023-12-02 18:47:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409329410] [2023-12-02 18:47:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:49,857 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 18:47:49,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409329410] [2023-12-02 18:47:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409329410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:47:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:47:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:47:49,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394171216] [2023-12-02 18:47:49,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:47:49,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:47:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:47:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:47:49,896 INFO L87 Difference]: Start difference. First operand has 103 states, 102 states have (on average 2.323529411764706) internal successors, (237), 102 states have internal predecessors, (237), 0 states have call successors, (0), 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 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 18:47:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:49,975 INFO L93 Difference]: Finished difference Result 170 states and 394 transitions. [2023-12-02 18:47:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:47:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 18:47:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:49,988 INFO L225 Difference]: With dead ends: 170 [2023-12-02 18:47:49,988 INFO L226 Difference]: Without dead ends: 165 [2023-12-02 18:47:49,990 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 18:47:49,993 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:49,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:47:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-02 18:47:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2023-12-02 18:47:50,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.3225806451612905) internal successors, (288), 124 states have internal predecessors, (288), 0 states have call successors, (0), 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 18:47:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 288 transitions. [2023-12-02 18:47:50,036 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 288 transitions. Word has length 16 [2023-12-02 18:47:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:50,036 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 288 transitions. [2023-12-02 18:47:50,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 18:47:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 288 transitions. [2023-12-02 18:47:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:47:50,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:50,039 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] [2023-12-02 18:47:50,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:47:50,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:50,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash 352566001, now seen corresponding path program 1 times [2023-12-02 18:47:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843744483] [2023-12-02 18:47:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:47:50,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843744483] [2023-12-02 18:47:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843744483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:47:50,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:47:50,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:47:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144756984] [2023-12-02 18:47:50,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:47:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:47:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:47:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:47:50,149 INFO L87 Difference]: Start difference. First operand 125 states and 288 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:50,198 INFO L93 Difference]: Finished difference Result 131 states and 296 transitions. [2023-12-02 18:47:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:47:50,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 18:47:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:50,200 INFO L225 Difference]: With dead ends: 131 [2023-12-02 18:47:50,200 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 18:47:50,201 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 18:47:50,202 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:50,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:47:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 18:47:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2023-12-02 18:47:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.2966101694915255) internal successors, (271), 118 states have internal predecessors, (271), 0 states have call successors, (0), 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 18:47:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 271 transitions. [2023-12-02 18:47:50,216 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 271 transitions. Word has length 20 [2023-12-02 18:47:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:50,216 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 271 transitions. [2023-12-02 18:47:50,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 271 transitions. [2023-12-02 18:47:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 18:47:50,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:50,218 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] [2023-12-02 18:47:50,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:47:50,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:50,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 60034967, now seen corresponding path program 1 times [2023-12-02 18:47:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367924918] [2023-12-02 18:47:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:47:50,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:50,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367924918] [2023-12-02 18:47:50,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367924918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:47:50,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:47:50,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:47:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78732224] [2023-12-02 18:47:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:47:50,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:47:50,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:50,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:47:50,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:47:50,337 INFO L87 Difference]: Start difference. First operand 119 states and 271 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:50,384 INFO L93 Difference]: Finished difference Result 123 states and 267 transitions. [2023-12-02 18:47:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:47:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-02 18:47:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:50,386 INFO L225 Difference]: With dead ends: 123 [2023-12-02 18:47:50,386 INFO L226 Difference]: Without dead ends: 105 [2023-12-02 18:47:50,387 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 18:47:50,388 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:50,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:47:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-02 18:47:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-02 18:47:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.2211538461538463) internal successors, (231), 104 states have internal predecessors, (231), 0 states have call successors, (0), 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 18:47:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 231 transitions. [2023-12-02 18:47:50,397 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 231 transitions. Word has length 20 [2023-12-02 18:47:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:50,398 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 231 transitions. [2023-12-02 18:47:50,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 231 transitions. [2023-12-02 18:47:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 18:47:50,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:50,400 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] [2023-12-02 18:47:50,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:47:50,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:50,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1751563284, now seen corresponding path program 1 times [2023-12-02 18:47:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379232721] [2023-12-02 18:47:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:50,564 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 18:47:50,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379232721] [2023-12-02 18:47:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379232721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:47:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:47:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:47:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742399237] [2023-12-02 18:47:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:47:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:47:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:47:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:47:50,567 INFO L87 Difference]: Start difference. First operand 105 states and 231 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 18:47:50,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:50,629 INFO L93 Difference]: Finished difference Result 140 states and 296 transitions. [2023-12-02 18:47:50,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:47:50,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 18:47:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:50,630 INFO L225 Difference]: With dead ends: 140 [2023-12-02 18:47:50,630 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 18:47:50,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:47:50,632 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:50,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:47:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 18:47:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-02 18:47:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.2095238095238097) internal successors, (232), 105 states have internal predecessors, (232), 0 states have call successors, (0), 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 18:47:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 232 transitions. [2023-12-02 18:47:50,642 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 232 transitions. Word has length 24 [2023-12-02 18:47:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:50,642 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 232 transitions. [2023-12-02 18:47:50,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 18:47:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 232 transitions. [2023-12-02 18:47:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:47:50,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:50,644 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 18:47:50,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:47:50,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:50,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2089696898, now seen corresponding path program 1 times [2023-12-02 18:47:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960354602] [2023-12-02 18:47:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:47:50,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960354602] [2023-12-02 18:47:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960354602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:47:50,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:47:50,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:47:50,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673278989] [2023-12-02 18:47:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:47:50,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:47:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:50,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:47:50,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:47:50,763 INFO L87 Difference]: Start difference. First operand 106 states and 232 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 18:47:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:50,819 INFO L93 Difference]: Finished difference Result 138 states and 291 transitions. [2023-12-02 18:47:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:47:50,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 18:47:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:50,821 INFO L225 Difference]: With dead ends: 138 [2023-12-02 18:47:50,821 INFO L226 Difference]: Without dead ends: 107 [2023-12-02 18:47:50,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:47:50,823 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:50,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:47:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-02 18:47:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-02 18:47:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.19811320754717) internal successors, (233), 106 states have internal predecessors, (233), 0 states have call successors, (0), 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 18:47:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 233 transitions. [2023-12-02 18:47:50,831 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 233 transitions. Word has length 25 [2023-12-02 18:47:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:50,832 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 233 transitions. [2023-12-02 18:47:50,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 18:47:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 233 transitions. [2023-12-02 18:47:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:47:50,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:50,833 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 18:47:50,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:47:50,834 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:47:50,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash -292594377, now seen corresponding path program 1 times [2023-12-02 18:47:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:50,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183479305] [2023-12-02 18:47:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:47:53,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183479305] [2023-12-02 18:47:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183479305] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:47:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421618343] [2023-12-02 18:47:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:47:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:47:53,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:47:53,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:47:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:53,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 18:47:53,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:53,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:47:53,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:47:53,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 18:47:53,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:47:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2023-12-02 18:47:53,367 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 18:47:53,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:47:53,509 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 18:47:53,509 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 16 treesize of output 18 [2023-12-02 18:47:53,624 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 8 treesize of output 1 [2023-12-02 18:47:53,768 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 8 treesize of output 1 [2023-12-02 18:47:54,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 18:47:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:47:54,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:57,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:57,014 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 147 treesize of output 99 [2023-12-02 18:47:57,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:57,041 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 3675 treesize of output 3523 [2023-12-02 18:47:57,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:57,167 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 833 treesize of output 815 [2023-12-02 18:47:57,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:57,231 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 784 treesize of output 736 [2023-12-02 18:47:57,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:47:57,300 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 713 treesize of output 589 [2023-12-02 18:48:05,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:05,068 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 122 treesize of output 86 [2023-12-02 18:48:05,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:05,098 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 2707 treesize of output 2587 [2023-12-02 18:48:05,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:05,153 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 261 treesize of output 277 [2023-12-02 18:48:05,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:05,199 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 246 treesize of output 250 [2023-12-02 18:48:05,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:05,247 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 250 treesize of output 230 [2023-12-02 18:48:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:48:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421618343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:48:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321289120] [2023-12-02 18:48:09,858 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 18:48:09,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:48:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2023-12-02 18:48:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677418802] [2023-12-02 18:48:09,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:48:09,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 18:48:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:48:09,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 18:48:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1688, Unknown=3, NotChecked=0, Total=1892 [2023-12-02 18:48:09,863 INFO L87 Difference]: Start difference. First operand 107 states and 233 transitions. Second operand has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:48:21,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| c_~q1~0.base)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (let ((.cse20 (+ c_~q1_back~0 1)) (.cse19 (select .cse16 .cse10))) (let ((.cse0 (+ .cse19 1)) (.cse6 (select |c_#memory_int| c_~q2~0.base)) (.cse1 (< c_~j~0 c_~N~0)) (.cse14 (+ c_~i~0 1)) (.cse21 (<= 1 c_~N~0)) (.cse2 (< c_~n1~0 .cse20)) (.cse3 (< c_~q1_back~0 0)) (.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse12 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse4 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse5 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (or (= c_~j~0 .cse0) .cse1) (= c_~q1~0.offset 0) (or (< c_~q2_back~0 0) .cse2 .cse3 (< c_~n2~0 (+ c_~q2_back~0 1)) .cse4 .cse5 (not (= c_~i~0 (select .cse6 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (and (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse9 (select (select .cse11 c_~q2~0.base) .cse12)) (.cse7 (select .cse11 c_~q1~0.base))) (or (not (= (select .cse7 .cse8) c_~j~0)) (< .cse9 c_~i~0) (< .cse9 (+ (select .cse7 .cse10) 1)))))) (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse13 (select .cse15 c_~q1~0.base))) (or (not (= (select .cse13 .cse8) c_~j~0)) (< (select .cse13 .cse10) .cse14) (< (select (select .cse15 c_~q2~0.base) .cse12) c_~i~0))))))) (or (not (= (select .cse16 .cse8) c_~j~0)) .cse2 .cse3 (let ((.cse18 (select .cse6 .cse12))) (let ((.cse17 (< (+ .cse18 1) c_~N~0))) (and (or .cse17 (< .cse18 .cse0)) (or (< .cse19 c_~N~0) .cse17)))) .cse4 .cse5) (or (not (= c_~q2_front~0 0)) (and (or (< c_~n1~0 2) (< c_~q1_back~0 1)) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (= 0 (select .cse6 0)) (or (< 0 .cse20) (< c_~q1_front~0 .cse20)) .cse21 (or (and (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) 2)) (or (not (= c_~q1_front~0 0)) (= c_~j~0 0))) (not (= c_~q1_back~0 0))))) (<= c_~q2_front~0 0) (or .cse1 (= c_~j~0 .cse14)) .cse21 (<= c_~j~0 1) (or .cse2 .cse3 (and (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse23 (select (select .cse24 c_~q2~0.base) .cse12)) (.cse22 (select .cse24 c_~q1~0.base))) (or (not (= (select .cse22 .cse8) c_~j~0)) (< (+ 1 .cse23) c_~N~0) (< .cse23 (+ (select .cse22 .cse10) 1)))))) (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse25 (select .cse26 c_~q1~0.base))) (or (not (= (select .cse25 .cse8) c_~j~0)) (< (+ 1 (select (select .cse26 c_~q2~0.base) .cse12)) c_~N~0) (< (select .cse25 .cse10) c_~N~0)))))) .cse4 .cse5) (= c_~i~0 1))))) is different from false [2023-12-02 18:48:29,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ c_~q1_back~0 1))) (let ((.cse4 (select |c_#memory_int| c_~q2~0.base)) (.cse0 (< c_~n1~0 .cse17)) (.cse1 (< c_~q1_back~0 0)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse8 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse3 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (or (< c_~q2_back~0 0) .cse0 .cse1 (< c_~n2~0 (+ c_~q2_back~0 1)) .cse2 .cse3 (not (= c_~i~0 (select .cse4 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (and (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse7 (select (select .cse9 c_~q2~0.base) .cse10)) (.cse5 (select .cse9 c_~q1~0.base))) (or (not (= (select .cse5 .cse6) c_~j~0)) (< .cse7 c_~i~0) (< .cse7 (+ (select .cse5 .cse8) 1)))))) (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (not (= (select .cse11 .cse6) c_~j~0)) (< (select .cse11 .cse8) (+ c_~i~0 1)) (< (select (select .cse12 c_~q2~0.base) .cse10) c_~i~0))))))) (let ((.cse13 (select |c_#memory_int| c_~q1~0.base))) (or (not (= (select .cse13 .cse6) c_~j~0)) .cse0 .cse1 (let ((.cse15 (select .cse4 .cse10))) (let ((.cse16 (select .cse13 .cse8)) (.cse14 (< (+ .cse15 1) c_~N~0))) (and (or .cse14 (< .cse15 (+ .cse16 1))) (or (< .cse16 c_~N~0) .cse14)))) .cse2 .cse3)) (or (not (= c_~q2_front~0 0)) (and (or (< c_~n1~0 2) (< c_~q1_back~0 1)) (= 0 (select .cse4 0)) (or (< 0 .cse17) (< c_~q1_front~0 .cse17)) (<= 1 c_~N~0) (or (and (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) 2)) (or (not (= c_~q1_front~0 0)) (= c_~j~0 0))) (not (= c_~q1_back~0 0))))) (<= c_~q2_front~0 0) (or .cse0 .cse1 (and (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse19 (select (select .cse20 c_~q2~0.base) .cse10)) (.cse18 (select .cse20 c_~q1~0.base))) (or (not (= (select .cse18 .cse6) c_~j~0)) (< (+ 1 .cse19) c_~N~0) (< .cse19 (+ (select .cse18 .cse8) 1)))))) (forall ((v_ArrVal_102 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_102))) (let ((.cse21 (select .cse22 c_~q1~0.base))) (or (not (= (select .cse21 .cse6) c_~j~0)) (< (+ 1 (select (select .cse22 c_~q2~0.base) .cse10)) c_~N~0) (< (select .cse21 .cse8) c_~N~0)))))) .cse2 .cse3)))) is different from false [2023-12-02 18:48:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:48:29,750 INFO L93 Difference]: Finished difference Result 521 states and 1129 transitions. [2023-12-02 18:48:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-02 18:48:29,751 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:48:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:48:29,754 INFO L225 Difference]: With dead ends: 521 [2023-12-02 18:48:29,754 INFO L226 Difference]: Without dead ends: 511 [2023-12-02 18:48:29,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1357, Invalid=8481, Unknown=70, NotChecked=394, Total=10302 [2023-12-02 18:48:29,758 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 371 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 182 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:48:29,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 199 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2836 Invalid, 63 Unknown, 250 Unchecked, 5.0s Time] [2023-12-02 18:48:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-02 18:48:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 218. [2023-12-02 18:48:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.248847926267281) internal successors, (488), 217 states have internal predecessors, (488), 0 states have call successors, (0), 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 18:48:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 488 transitions. [2023-12-02 18:48:29,778 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 488 transitions. Word has length 26 [2023-12-02 18:48:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:48:29,779 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 488 transitions. [2023-12-02 18:48:29,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:48:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 488 transitions. [2023-12-02 18:48:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:48:29,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:48:29,782 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 18:48:29,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:48:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:29,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:48:29,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:48:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1364451077, now seen corresponding path program 2 times [2023-12-02 18:48:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:48:29,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598000801] [2023-12-02 18:48:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:48:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:48:31,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:48:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598000801] [2023-12-02 18:48:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598000801] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974103737] [2023-12-02 18:48:31,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:48:31,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:48:31,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:48:31,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:48:31,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 18:48:31,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:48:31,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 18:48:31,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:32,129 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 18:48:32,201 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 8 treesize of output 1 [2023-12-02 18:48:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:48:32,407 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 16 treesize of output 11 [2023-12-02 18:48:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:48:32,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:33,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_~q1_back~0 4)) (.cse4 (* c_~q1_front~0 4)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_137 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137))) (or (< (+ (select (select .cse0 c_~q2~0.base) .cse1) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (not (= (select .cse2 (+ .cse3 ~q1~0.offset)) c_~j~0)) (< (select .cse2 (+ .cse4 ~q1~0.offset)) c_~N~0))))))) (forall ((v_ArrVal_137 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137))) (let ((.cse5 (select (select .cse7 c_~q2~0.base) .cse1))) (or (< (+ .cse5 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse7 ~q1~0.base))) (or (not (= (select .cse6 (+ .cse3 ~q1~0.offset)) c_~j~0)) (< .cse5 (+ (select .cse6 (+ .cse4 ~q1~0.offset)) 1))))))))))) is different from false [2023-12-02 18:48:33,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:33,797 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 144 treesize of output 96 [2023-12-02 18:48:33,886 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 18:48:33,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1139 treesize of output 1067 [2023-12-02 18:48:33,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:33,951 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 473 treesize of output 393 [2023-12-02 18:48:34,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:34,030 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 352 treesize of output 366 [2023-12-02 18:48:57,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:57,635 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 82 [2023-12-02 18:48:57,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:48:57,676 INFO L349 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-12-02 18:48:57,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 209 treesize of output 200 [2023-12-02 18:48:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:48:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:48:57,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:48:57,710 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 128 [2023-12-02 18:48:57,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:48:57,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 88 [2023-12-02 18:48:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:48:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974103737] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:48:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [965619597] [2023-12-02 18:48:58,084 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 18:48:58,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:48:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2023-12-02 18:48:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265079542] [2023-12-02 18:48:58,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:48:58,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 18:48:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:48:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 18:48:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1499, Unknown=1, NotChecked=78, Total=1722 [2023-12-02 18:48:58,087 INFO L87 Difference]: Start difference. First operand 218 states and 488 transitions. Second operand has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:49:03,280 INFO L93 Difference]: Finished difference Result 610 states and 1366 transitions. [2023-12-02 18:49:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-02 18:49:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:49:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:49:03,285 INFO L225 Difference]: With dead ends: 610 [2023-12-02 18:49:03,285 INFO L226 Difference]: Without dead ends: 590 [2023-12-02 18:49:03,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=914, Invalid=7275, Unknown=5, NotChecked=178, Total=8372 [2023-12-02 18:49:03,288 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 540 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 151 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:49:03,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 159 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1844 Invalid, 3 Unknown, 303 Unchecked, 1.8s Time] [2023-12-02 18:49:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-12-02 18:49:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 333. [2023-12-02 18:49:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.3012048192771086) internal successors, (764), 332 states have internal predecessors, (764), 0 states have call successors, (0), 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 18:49:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 764 transitions. [2023-12-02 18:49:03,305 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 764 transitions. Word has length 26 [2023-12-02 18:49:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:49:03,306 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 764 transitions. [2023-12-02 18:49:03,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 764 transitions. [2023-12-02 18:49:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:49:03,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:49:03,308 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 18:49:03,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 18:49:03,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:49:03,509 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:49:03,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:49:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1799663747, now seen corresponding path program 3 times [2023-12-02 18:49:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:49:03,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794179536] [2023-12-02 18:49:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:49:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:49:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:49:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:49:05,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:49:05,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794179536] [2023-12-02 18:49:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794179536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:49:05,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860173953] [2023-12-02 18:49:05,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:49:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:49:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:49:05,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:49:05,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:49:05,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:49:05,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:49:05,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:49:05,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:49:05,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:05,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 18:49:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:05,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2023-12-02 18:49:05,327 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 23 treesize of output 1 [2023-12-02 18:49:05,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:05,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:05,429 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:49:05,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-12-02 18:49:05,527 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 15 treesize of output 1 [2023-12-02 18:49:05,624 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 8 treesize of output 1 [2023-12-02 18:49:05,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:49:05,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 18:49:06,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 18 [2023-12-02 18:49:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:49:06,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:49:08,285 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-12-02 18:49:08,285 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 238 treesize of output 112 [2023-12-02 18:49:08,419 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-12-02 18:49:08,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1011 treesize of output 995 [2023-12-02 18:49:08,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:49:08,485 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 449 treesize of output 381 [2023-12-02 18:49:08,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:49:08,552 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 340 treesize of output 354 [2023-12-02 18:49:35,312 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-12-02 18:49:35,312 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 192 treesize of output 98 [2023-12-02 18:49:35,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:49:35,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 257 treesize of output 351 [2023-12-02 18:49:35,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:49:35,456 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 185 treesize of output 189 [2023-12-02 18:49:35,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:49:35,534 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 127 treesize of output 177 [2023-12-02 18:49:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:49:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860173953] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:49:50,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2063828247] [2023-12-02 18:49:50,891 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 18:49:50,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:49:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2023-12-02 18:49:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746059958] [2023-12-02 18:49:50,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:49:50,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 18:49:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 18:49:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1727, Unknown=2, NotChecked=0, Total=1892 [2023-12-02 18:49:50,894 INFO L87 Difference]: Start difference. First operand 333 states and 764 transitions. Second operand has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:49:54,423 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 18:49:55,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse35 (* c_~q2_back~0 4)) (.cse44 (* c_~q2_front~0 4)) (.cse31 (select .cse34 0)) (.cse8 (= c_~q2_front~0 0))) (let ((.cse2 (= c_~j~0 c_~i~0)) (.cse16 (+ c_~j~0 1)) (.cse24 (not (= c_~q1_front~0 0))) (.cse23 (= c_~i~0 0)) (.cse22 (= c_~q2_back~0 0)) (.cse26 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base))) (.cse25 (not .cse8)) (.cse29 (= c_~q1_back~0 0)) (.cse30 (= c_~j~0 0)) (.cse28 (<= 1 c_~N~0)) (.cse27 (<= (+ .cse31 1) c_~N~0)) (.cse10 (= c_~q1_back~0 c_~q1_front~0)) (.cse32 (< c_~q2_back~0 0)) (.cse19 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse20 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse21 (< c_~q1_back~0 0)) (.cse33 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse38 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse50 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ c_~i~0 1)) (.cse37 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse46 (+ .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (= c_~q2~0.offset 0) (or (let ((.cse11 (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148|) 0))))) (.cse3 (< c_~j~0 c_~i~0)) (.cse15 (not .cse11))) (let ((.cse14 (or .cse9 .cse3 .cse15)) (.cse6 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1))) (.cse7 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))) (.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0))) (.cse1 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1))) (.cse13 (not .cse2)) (.cse5 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148|) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (.cse12 (not .cse4)) (.cse18 (and (or .cse2 .cse3) .cse10))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse2 .cse3) (or (and (or .cse6 .cse7) (or .cse8 .cse9)) .cse10) (or .cse8 (and (or .cse11 .cse12 .cse9 .cse13) .cse14)) (or (and (or .cse9 .cse10 .cse15) (or .cse5 (and (<= .cse16 c_~i~0) .cse10)) .cse14) .cse8) (or .cse0 .cse1 .cse10 .cse4) (or .cse6 .cse7 .cse3) (or .cse8 .cse9 (< c_~j~0 .cse17)) (or .cse0 .cse1 .cse8 .cse3) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148|) 0)) (= |c_ULTIMATE.start_main_~#t1~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_148|))) .cse18) (or .cse8 (and .cse13 .cse10) .cse9) (or .cse11 .cse5 .cse8 .cse10) (or .cse0 .cse1 .cse8 .cse10) (or .cse8 (and (or .cse9 .cse13) (or .cse5 .cse3) (or .cse9 .cse10 .cse4 .cse15) (or .cse12 .cse9 .cse10))) (or .cse12 .cse18 .cse9))))) .cse19 .cse20 .cse21 (not .cse22)) (= c_~q1~0.offset 0) (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 2))) .cse23 .cse2 (or .cse24 .cse21 (and (<= c_~q2_front~0 0) (or .cse25 (and .cse26 .cse27)) .cse28 .cse29 .cse30)) (<= .cse16 c_~N~0) (or .cse24 (and (<= 0 c_~i~0) (or (< c_~q2_front~0 1) (< (+ c_~q2_front~0 c_~n2~0) (+ c_~q2_back~0 2))) (or (and (or (and .cse23 .cse22) (< .cse31 .cse17)) .cse26) .cse32 .cse25) .cse29 .cse30) .cse21) .cse28 (<= c_~i~0 0) (not (= c_~q1~0.base c_~q2~0.base)) .cse8 .cse27 (<= c_~n1~0 1) (<= 0 .cse31) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse32 .cse19 .cse21 .cse33 (not (= c_~i~0 (select .cse34 (+ .cse35 c_~q2~0.offset)))) (let ((.cse40 (+ c_~q2~0.offset .cse44))) (and (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse36 (select .cse39 c_~q1~0.base))) (or (not (= (select .cse36 .cse37) c_~j~0)) (< (select .cse36 .cse38) c_~i~0) (< (select (select .cse39 c_~q2~0.base) .cse40) .cse17))))) (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse43 (select .cse42 c_~q1~0.base))) (let ((.cse41 (select .cse43 .cse38))) (or (< .cse41 (+ (select (select .cse42 c_~q2~0.base) .cse40) 1)) (not (= (select .cse43 .cse37) c_~j~0)) (< .cse41 c_~i~0))))))))) (or .cse32 .cse19 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_176))) (or (not (= c_~i~0 (select (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse46))) (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse49 (store .cse45 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse47 (select .cse49 c_~q1~0.base))) (let ((.cse48 (select .cse47 .cse38))) (or (not (= c_~j~0 (select .cse47 .cse37))) (< .cse48 c_~i~0) (< .cse48 (+ (select (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse50) 1)))))))))) (forall ((v_ArrVal_176 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_176))) (or (not (= c_~i~0 (select (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse46))) (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse53 (store .cse51 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse52 (select .cse53 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse52 .cse37))) (< (select .cse52 .cse38) c_~i~0) (< (select (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse50) .cse17))))))))) .cse21 .cse33) (<= c_~j~0 0) .cse10 (<= 0 c_~j~0) (or .cse32 .cse19 .cse20 .cse21 .cse33 (let ((.cse58 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse59 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_174 Int) (v_ArrVal_176 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse58 .cse59 v_ArrVal_174)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_176))) (or (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse55 (select .cse56 c_~q1~0.base))) (let ((.cse54 (select .cse55 .cse38))) (or (< .cse54 c_~i~0) (not (= (select .cse55 .cse37) c_~j~0)) (< .cse54 (+ 1 (select (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse50)))))))) (not (= c_~i~0 (select (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse46)))))) (forall ((v_ArrVal_174 Int) (v_ArrVal_176 (Array Int Int))) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse58 .cse59 v_ArrVal_174)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_176))) (or (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse61 (store .cse62 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_177))) (let ((.cse60 (select .cse61 c_~q1~0.base))) (or (< (select .cse60 .cse38) c_~i~0) (< (select (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse50) .cse17) (not (= (select .cse60 .cse37) c_~j~0)))))) (not (= c_~i~0 (select (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse46))))))))) (<= (+ 2 c_~q1~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|))))) is different from false [2023-12-02 18:50:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:10,169 INFO L93 Difference]: Finished difference Result 688 states and 1548 transitions. [2023-12-02 18:50:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-02 18:50:10,170 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:50:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:10,174 INFO L225 Difference]: With dead ends: 688 [2023-12-02 18:50:10,174 INFO L226 Difference]: Without dead ends: 678 [2023-12-02 18:50:10,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=918, Invalid=7221, Unknown=55, NotChecked=178, Total=8372 [2023-12-02 18:50:10,177 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 388 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 133 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:10,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 229 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2632 Invalid, 33 Unknown, 240 Unchecked, 6.2s Time] [2023-12-02 18:50:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-12-02 18:50:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 349. [2023-12-02 18:50:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.3333333333333335) internal successors, (812), 348 states have internal predecessors, (812), 0 states have call successors, (0), 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 18:50:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 812 transitions. [2023-12-02 18:50:10,189 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 812 transitions. Word has length 26 [2023-12-02 18:50:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:10,189 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 812 transitions. [2023-12-02 18:50:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 812 transitions. [2023-12-02 18:50:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:50:10,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:10,191 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 18:50:10,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:50:10,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:10,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:50:10,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2034647819, now seen corresponding path program 4 times [2023-12-02 18:50:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:10,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257808475] [2023-12-02 18:50:10,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:11,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257808475] [2023-12-02 18:50:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257808475] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076916678] [2023-12-02 18:50:11,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:50:11,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:11,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:11,800 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:11,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:50:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:11,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 18:50:11,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:12,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:50:12,393 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 18:50:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:12,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:13,317 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 18:50:13,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 142 treesize of output 182 [2023-12-02 18:50:13,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:13,347 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 90 treesize of output 100 [2023-12-02 18:50:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:15,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076916678] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:15,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496270588] [2023-12-02 18:50:15,257 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 18:50:15,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:15,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 38 [2023-12-02 18:50:15,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432442954] [2023-12-02 18:50:15,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:15,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-02 18:50:15,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-02 18:50:15,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1334, Unknown=1, NotChecked=0, Total=1482 [2023-12-02 18:50:15,260 INFO L87 Difference]: Start difference. First operand 349 states and 812 transitions. Second operand has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:50:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:23,437 INFO L93 Difference]: Finished difference Result 780 states and 1830 transitions. [2023-12-02 18:50:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-02 18:50:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:50:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:23,442 INFO L225 Difference]: With dead ends: 780 [2023-12-02 18:50:23,442 INFO L226 Difference]: Without dead ends: 765 [2023-12-02 18:50:23,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=981, Invalid=7193, Unknown=16, NotChecked=0, Total=8190 [2023-12-02 18:50:23,445 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 574 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 160 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:23,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 169 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2007 Invalid, 46 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 18:50:23,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-12-02 18:50:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 483. [2023-12-02 18:50:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 2.3983402489626555) internal successors, (1156), 482 states have internal predecessors, (1156), 0 states have call successors, (0), 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 18:50:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1156 transitions. [2023-12-02 18:50:23,460 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1156 transitions. Word has length 26 [2023-12-02 18:50:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:23,460 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 1156 transitions. [2023-12-02 18:50:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:50:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1156 transitions. [2023-12-02 18:50:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:50:23,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:23,462 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 18:50:23,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:50:23,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:23,663 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:50:23,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1256556637, now seen corresponding path program 5 times [2023-12-02 18:50:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531668549] [2023-12-02 18:50:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:50:25,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:25,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531668549] [2023-12-02 18:50:25,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531668549] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:25,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154850783] [2023-12-02 18:50:25,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:50:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:25,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:25,384 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:25,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:50:25,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 18:50:25,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:50:25,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 18:50:25,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:25,687 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 23 treesize of output 1 [2023-12-02 18:50:25,741 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 8 treesize of output 1 [2023-12-02 18:50:25,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:50:25,966 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 26 [2023-12-02 18:50:26,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:26,291 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 46 treesize of output 34 [2023-12-02 18:50:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:50:26,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:27,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:27,994 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 144 treesize of output 96 [2023-12-02 18:50:28,082 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 18:50:28,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1217 treesize of output 1137 [2023-12-02 18:50:28,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:28,165 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 461 treesize of output 475 [2023-12-02 18:50:28,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:50:28,212 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 388 treesize of output 308 [2023-12-02 18:50:52,289 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 18:50:52,289 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 118 treesize of output 1 [2023-12-02 18:50:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:50:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154850783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:52,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966766782] [2023-12-02 18:50:52,514 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 18:50:52,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:52,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2023-12-02 18:50:52,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136882680] [2023-12-02 18:50:52,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:52,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 18:50:52,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 18:50:52,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1572, Unknown=6, NotChecked=0, Total=1722 [2023-12-02 18:50:52,517 INFO L87 Difference]: Start difference. First operand 483 states and 1156 transitions. Second operand has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:59,643 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (* c_~q1_back~0 4)) (.cse5 (* c_~q1_front~0 4)) (.cse0 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse1 (< c_~q2_front~0 0))) (and (or (< c_~q2_back~0 0) (< c_~n2~0 (+ c_~q2_back~0 1)) .cse0 .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) (+ c_~i~0 1)) (< (select .cse4 (+ .cse5 ~q1~0.offset)) c_~i~0) (not (= (select .cse4 (+ .cse6 ~q1~0.offset)) c_~j~0)))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse9 (select .cse8 ~q1~0.base))) (let ((.cse7 (select .cse9 (+ .cse5 ~q1~0.offset)))) (or (< .cse7 (+ (select (select .cse8 c_~q2~0.base) .cse3) 1)) (< .cse7 c_~i~0) (not (= (select .cse9 (+ .cse6 ~q1~0.offset)) c_~j~0)))))))) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or (and (forall ((v_ArrVal_245 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (+ (select .cse11 (+ .cse5 ~q1~0.offset)) 1) c_~N~0) (not (= (select .cse11 (+ .cse6 ~q1~0.offset)) c_~j~0)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_245 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_245))) (let ((.cse14 (select .cse13 ~q1~0.base))) (let ((.cse12 (select .cse14 (+ .cse5 ~q1~0.offset)))) (or (< (+ .cse12 1) c_~N~0) (< .cse12 (+ (select (select .cse13 c_~q2~0.base) .cse3) 1)) (not (= (select .cse14 (+ .cse6 ~q1~0.offset)) c_~j~0)))))))) .cse0 .cse1) (or (not (= c_~q2_front~0 0)) (not (= c_~q2_back~0 0)) (and (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) (< c_~j~0 c_~i~0)) (<= c_~j~0 c_~i~0) (= c_~q1_back~0 c_~q1_front~0))) (or (= c_~j~0 c_~i~0) (< c_~i~0 c_~N~0)))) is different from false [2023-12-02 18:51:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:51:03,130 INFO L93 Difference]: Finished difference Result 911 states and 2174 transitions. [2023-12-02 18:51:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-02 18:51:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:51:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:51:03,135 INFO L225 Difference]: With dead ends: 911 [2023-12-02 18:51:03,135 INFO L226 Difference]: Without dead ends: 901 [2023-12-02 18:51:03,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2059 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=969, Invalid=7940, Unknown=25, NotChecked=186, Total=9120 [2023-12-02 18:51:03,138 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 554 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 140 mSolverCounterUnsat, 93 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 93 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:51:03,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 184 Invalid, 3166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2811 Invalid, 93 Unknown, 122 Unchecked, 4.2s Time] [2023-12-02 18:51:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2023-12-02 18:51:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 559. [2023-12-02 18:51:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 2.4767025089605736) internal successors, (1382), 558 states have internal predecessors, (1382), 0 states have call successors, (0), 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 18:51:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1382 transitions. [2023-12-02 18:51:03,155 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1382 transitions. Word has length 26 [2023-12-02 18:51:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:51:03,156 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1382 transitions. [2023-12-02 18:51:03,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1382 transitions. [2023-12-02 18:51:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:51:03,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:51:03,158 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 18:51:03,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:51:03,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:03,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:51:03,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:51:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1482611017, now seen corresponding path program 6 times [2023-12-02 18:51:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:51:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583346666] [2023-12-02 18:51:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:51:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:04,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:51:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583346666] [2023-12-02 18:51:04,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583346666] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:51:04,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410013661] [2023-12-02 18:51:04,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:51:04,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:51:04,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:51:04,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:51:05,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:51:05,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:51:05,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:51:05,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:51:05,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:51:05,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2023-12-02 18:51:05,031 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 18:51:05,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:51:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 18:51:05,156 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 23 treesize of output 1 [2023-12-02 18:51:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:51:05,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:51:05,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:51:05,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-12-02 18:51:05,386 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 15 treesize of output 1 [2023-12-02 18:51:05,511 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 8 treesize of output 1 [2023-12-02 18:51:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:51:05,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 18:51:06,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 18 [2023-12-02 18:51:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:06,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:51:08,209 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-12-02 18:51:08,210 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 238 treesize of output 112 [2023-12-02 18:51:08,364 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-12-02 18:51:08,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1011 treesize of output 995 [2023-12-02 18:51:08,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:08,453 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 438 treesize of output 452 [2023-12-02 18:51:08,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:08,510 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 397 treesize of output 329 [2023-12-02 18:51:40,333 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-12-02 18:51:40,333 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 192 treesize of output 98 [2023-12-02 18:51:40,472 INFO L349 Elim1Store]: treesize reduction 5, result has 96.1 percent of original size [2023-12-02 18:51:40,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 257 treesize of output 346 [2023-12-02 18:51:40,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:40,551 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 185 treesize of output 189 [2023-12-02 18:51:40,576 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:51:40,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:51:40,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 169 [2023-12-02 18:51:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:51:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410013661] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:51:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129373015] [2023-12-02 18:51:47,389 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 18:51:47,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:51:47,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2023-12-02 18:51:47,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619328784] [2023-12-02 18:51:47,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:51:47,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 18:51:47,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:51:47,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 18:51:47,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1732, Unknown=3, NotChecked=0, Total=1892 [2023-12-02 18:51:47,392 INFO L87 Difference]: Start difference. First operand 559 states and 1382 transitions. Second operand has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:52:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:11,577 INFO L93 Difference]: Finished difference Result 944 states and 2240 transitions. [2023-12-02 18:52:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 18:52:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:52:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:11,583 INFO L225 Difference]: With dead ends: 944 [2023-12-02 18:52:11,583 INFO L226 Difference]: Without dead ends: 934 [2023-12-02 18:52:11,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1175, Invalid=7852, Unknown=93, NotChecked=0, Total=9120 [2023-12-02 18:52:11,586 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 582 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 208 mSolverCounterUnsat, 73 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 73 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:11,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 226 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2530 Invalid, 73 Unknown, 0 Unchecked, 7.2s Time] [2023-12-02 18:52:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-02 18:52:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 575. [2023-12-02 18:52:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 2.484320557491289) internal successors, (1426), 574 states have internal predecessors, (1426), 0 states have call successors, (0), 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 18:52:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1426 transitions. [2023-12-02 18:52:11,603 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1426 transitions. Word has length 26 [2023-12-02 18:52:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:11,604 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1426 transitions. [2023-12-02 18:52:11,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 43 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1426 transitions. [2023-12-02 18:52:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:52:11,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:11,605 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 18:52:11,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 18:52:11,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:11,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:52:11,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1247626945, now seen corresponding path program 7 times [2023-12-02 18:52:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:52:11,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674036234] [2023-12-02 18:52:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:52:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:13,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:52:13,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674036234] [2023-12-02 18:52:13,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674036234] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:52:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968610483] [2023-12-02 18:52:13,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:52:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:52:13,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:52:13,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:52:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:13,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 18:52:13,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:52:13,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:52:13,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-12-02 18:52:13,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:52:13,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 11 [2023-12-02 18:52:13,513 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 18:52:13,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:52:13,622 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 18:52:13,622 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 16 treesize of output 18 [2023-12-02 18:52:13,723 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 8 treesize of output 1 [2023-12-02 18:52:13,830 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 8 treesize of output 1 [2023-12-02 18:52:14,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-12-02 18:52:14,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 18 [2023-12-02 18:52:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:14,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:52:17,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:17,586 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 122 treesize of output 86 [2023-12-02 18:52:17,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:17,605 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 1323 treesize of output 1267 [2023-12-02 18:52:17,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:17,657 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 264 treesize of output 268 [2023-12-02 18:52:17,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:17,698 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 239 treesize of output 255 [2023-12-02 18:52:17,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:17,742 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 250 treesize of output 230 [2023-12-02 18:52:19,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:19,448 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 122 treesize of output 86 [2023-12-02 18:52:19,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:19,465 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 383 treesize of output 375 [2023-12-02 18:52:19,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:19,504 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 337 treesize of output 317 [2023-12-02 18:52:19,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:19,543 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 280 treesize of output 284 [2023-12-02 18:52:19,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:52:19,587 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 208 treesize of output 224 [2023-12-02 18:52:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:52:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968610483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:52:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033296110] [2023-12-02 18:52:26,851 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 18:52:26,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:52:26,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 45 [2023-12-02 18:52:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88558501] [2023-12-02 18:52:26,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:52:26,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 18:52:26,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:52:26,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 18:52:26,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1887, Unknown=4, NotChecked=0, Total=2070 [2023-12-02 18:52:26,853 INFO L87 Difference]: Start difference. First operand 575 states and 1426 transitions. Second operand has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:52:30,667 WARN L539 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 18:52:30,685 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (* c_~q2_front~0 4)) (.cse8 (+ c_~i~0 1)) (.cse2 (* c_~q2_back~0 4)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse12 (< c_~q2_back~0 0)) (.cse13 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse14 (< c_~q1_front~0 0)) (.cse15 (< c_~q1_back~0 0)) (.cse16 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse17 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse18 (< c_~q2_front~0 0))) (and (= c_~j~0 c_~i~0) (or .cse0 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse3 (select .cse5 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse3 .cse4))) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse3 .cse7) .cse8)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse10 (select .cse11 c_~q1~0.base))) (or (< (select .cse10 .cse7) c_~i~0) (not (= c_~j~0 (select .cse10 .cse4))) (< (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8))))))))) .cse12 .cse13 .cse14 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17 .cse18) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse19 (select .cse20 c_~q1~0.base))) (or (not (= (select .cse19 .cse4) c_~j~0)) (< (select .cse19 .cse7) .cse8) (< (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse22 (select .cse23 c_~q1~0.base))) (or (< (select .cse22 .cse7) c_~i~0) (not (= (select .cse22 .cse4) c_~j~0)) (< (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse8))))) (not (= c_~i~0 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse2 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse0 .cse12 .cse13 .cse14 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse16 .cse17 .cse18))) is different from false [2023-12-02 18:52:30,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse4 (+ c_~i~0 1)) (.cse11 (* c_~q1_back~0 4)) (.cse12 (* c_~q1_front~0 4)) (.cse1 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse13 (< c_~q1_front~0 0)) (.cse14 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~q1_back~0 0))) (and (= c_~j~0 c_~i~0) (or .cse0 (not (= c_~q2_front~0 0)) .cse1 (let ((.cse3 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0)) (forall ((v_ArrVal_325 (Array Int Int)) (v_subst_125 Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse2 .cse3) .cse4) (not (= (select .cse2 .cse5) c_~j~0)) (< (select (select .cse6 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) v_subst_125) c_~i~0))))) (not (= (select (select .cse7 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) v_subst_125) c_~i~0))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0)) (forall ((v_ArrVal_325 (Array Int Int)) (v_subst_124 Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse8 .cse3) c_~i~0) (< (select (select .cse9 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) v_subst_124) .cse4) (not (= (select .cse8 .cse5) c_~j~0)))))) (not (= (select (select .cse10 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) v_subst_124) c_~i~0))))))))) .cse13 .cse14 .cse15 (not (= c_~q2_back~0 0))) (or .cse0 (let ((.cse17 (* c_~q2_back~0 4)) (.cse22 (+ .cse12 c_~q1~0.offset)) (.cse19 (+ .cse11 c_~q1~0.offset)) (.cse21 (* c_~q2_front~0 4))) (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse20 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse18 (select .cse20 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse18 .cse19))) (< (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse18 .cse22) .cse4)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse25 (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse24 (select .cse25 c_~q1~0.base))) (or (< (select .cse24 .cse22) c_~i~0) (not (= c_~j~0 (select .cse24 .cse19))) (< (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse4)))))))))) (< c_~q2_back~0 0) .cse1 .cse13 .cse14 .cse15 (< c_~n2~0 (+ c_~q2_back~0 1)) (< c_~n2~0 (+ c_~q2_front~0 1)) (< c_~q2_front~0 0)))) is different from false [2023-12-02 18:52:31,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse2 (< c_~q2_back~0 0)) (.cse3 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse4 (< c_~q1_front~0 0)) (.cse5 (< c_~q1_back~0 0)) (.cse6 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse13 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse8 (< c_~q2_front~0 0)) (.cse16 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))) (and (or (< c_~i~0 c_~N~0) (let ((.cse0 (+ c_~j~0 1))) (and (<= .cse0 c_~i~0) (or (= c_~N~0 c_~i~0) (< .cse0 c_~N~0))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse11 (select .cse9 c_~q1~0.base))) (or (< (+ (select (select .cse9 c_~q2~0.base) .cse10) 1) c_~N~0) (not (= (select .cse11 .cse12) c_~j~0)) (< (select .cse11 .cse13) c_~N~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse14 (select .cse15 c_~q1~0.base))) (or (< (+ (select .cse14 .cse13) 1) c_~N~0) (not (= (select .cse14 .cse12) c_~j~0)) (< (select (select .cse15 c_~q2~0.base) .cse10) c_~N~0)))))) .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse19 (+ c_~i~0 1))) (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse17 (select .cse18 c_~q1~0.base))) (or (not (= (select .cse17 .cse12) c_~j~0)) (< (select (select .cse18 c_~q2~0.base) .cse10) .cse19) (< (select .cse17 .cse13) c_~i~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse20 (select .cse21 c_~q1~0.base))) (or (< (select .cse20 .cse13) .cse19) (not (= (select .cse20 .cse12) c_~j~0)) (< (select (select .cse21 c_~q2~0.base) .cse10) c_~i~0))))))) .cse7 .cse8 .cse16))) is different from false [2023-12-02 18:52:33,977 WARN L539 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 18:52:36,109 WARN L539 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 18:52:36,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~q2_front~0 4))) (let ((.cse7 (+ c_~q2~0.offset .cse24)) (.cse14 (not (= c_~q2_front~0 0))) (.cse13 (not (= c_~q2_back~0 0))) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse25 (+ c_~i~0 1)) (.cse21 (* c_~q2_back~0 4)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse29 (< c_~q2_back~0 0)) (.cse1 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse2 (< c_~q1_front~0 0)) (.cse19 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse3 (< c_~q1_back~0 0)) (.cse30 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse4 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse5 (< c_~q2_front~0 0)) (.cse31 (= c_~j~0 0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (= c_~i~0 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse8 (select .cse6 c_~q1~0.base))) (or (< (+ (select (select .cse6 c_~q2~0.base) .cse7) 1) c_~N~0) (not (= (select .cse8 .cse9) c_~j~0)) (< (select .cse8 .cse10) c_~N~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse11 (select .cse12 c_~q1~0.base))) (or (< (+ (select .cse11 .cse10) 1) c_~N~0) (not (= (select .cse11 .cse9) c_~j~0)) (< (select (select .cse12 c_~q2~0.base) .cse7) c_~N~0))))))) (or .cse13 (and (<= c_~q2_front~0 0) (or .cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)))) (not (= c_~n2~0 1))) (let ((.cse15 (select |c_#memory_int| c_~q1~0.base))) (or .cse0 (not (= (select .cse15 .cse9) c_~j~0)) .cse1 (let ((.cse17 (select .cse15 .cse10)) (.cse16 (select (select |c_#memory_int| c_~q2~0.base) .cse7))) (and (or (< .cse16 c_~N~0) (< (+ .cse17 1) c_~N~0)) (or (< .cse17 c_~N~0) (< (+ .cse16 1) c_~N~0)))) .cse2 .cse3 .cse4 .cse5)) (<= 1 c_~N~0) (or .cse0 .cse14 .cse1 .cse2 (let ((.cse18 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse18)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse18) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse19 .cse3 .cse13) (or .cse0 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse23 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse22 (select .cse23 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse22 .cse9))) (< (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse24 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse22 .cse10) .cse25)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse28 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse27 (select .cse28 c_~q1~0.base))) (or (< (select .cse27 .cse10) c_~i~0) (not (= c_~j~0 (select .cse27 .cse9))) (< (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse24 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))))))) .cse29 .cse1 .cse2 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse30 .cse4 .cse5) (or (and (or (not (= c_~q1_front~0 0)) .cse31) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse32 (select .cse33 c_~q1~0.base))) (or (not (= (select .cse32 .cse9) c_~j~0)) (< (select .cse32 .cse10) .cse25) (< (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse24 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse36 (store .cse37 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse35 (select .cse36 c_~q1~0.base))) (or (< (select .cse35 .cse10) c_~i~0) (not (= (select .cse35 .cse9) c_~j~0)) (< (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse24 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))) (not (= c_~i~0 (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse0 .cse29 .cse1 .cse2 .cse19 .cse3 .cse30 .cse4 .cse5) (<= c_~n2~0 1) (= c_~n1~0 1) .cse31))) is different from false [2023-12-02 18:52:38,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q1_front~0 1)) (.cse4 (* c_~q1_front~0 4)) (.cse17 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse5 (<= c_~q2_front~0 0)) (.cse8 (= c_~n2~0 1)) (.cse3 (select |c_#memory_int| c_~q1~0.base)) (.cse6 (not (= c_~q2_back~0 0))) (.cse1 (not (= c_~q2_front~0 0))) (.cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base))) (.cse2 (= 0 (select .cse17 0))) (.cse9 (not (= c_~q1_front~0 0))) (.cse24 (+ .cse4 c_~q1~0.offset)) (.cse21 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse23 (* c_~q2_front~0 4)) (.cse25 (+ c_~i~0 1)) (.cse19 (* c_~q2_back~0 4)) (.cse10 (< c_~n1~0 .cse0)) (.cse29 (< c_~q2_back~0 0)) (.cse11 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse12 (< c_~q1_front~0 0)) (.cse14 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~q1_back~0 0)) (.cse30 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse31 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse32 (< c_~q2_front~0 0)) (.cse34 (<= c_~q1_front~0 0)) (.cse33 (= c_~j~0 0))) (and (= c_~q2~0.offset 0) (<= .cse0 c_~n1~0) (or .cse1 .cse2) (= c_~q1~0.offset 0) (<= (select .cse3 .cse4) 0) (= c_~i~0 0) (<= 0 c_~q1_front~0) .cse5 (or .cse6 (and .cse5 (or .cse1 .cse7)) (not .cse8)) .cse8 (or .cse9 (= (select .cse3 0) 0)) (<= 1 c_~N~0) (not (= c_~q1~0.base c_~q2~0.base)) (<= c_~n1~0 1) (or .cse10 .cse1 .cse11 .cse12 (let ((.cse13 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse13)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse13) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse14 .cse15 .cse6) (exists ((v_~q2_back~0_88 Int)) (let ((.cse16 (select .cse17 (+ (* v_~q2_back~0_88 4) c_~q2~0.offset)))) (and (<= 0 .cse16) (<= 0 v_~q2_back~0_88) (<= (+ .cse16 1) c_~N~0) (<= (+ v_~q2_back~0_88 1) c_~n2~0) (<= c_~q2_front~0 v_~q2_back~0_88)))) (or .cse1 (and .cse7 .cse2)) (or .cse10 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse22 (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse20 (select .cse22 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse20 .cse21))) (< (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse20 .cse24) .cse25)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse28 (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse27 (select .cse28 c_~q1~0.base))) (or (< (select .cse27 .cse24) c_~i~0) (not (= c_~j~0 (select .cse27 .cse21))) (< (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))))))) .cse29 .cse11 .cse12 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15 .cse30 .cse31 .cse32) (or (and (or .cse9 .cse33) .cse34) (not (= c_~q1_back~0 0))) (exists ((~q1~0.base Int)) (let ((.cse35 (select (select |c_#memory_int| ~q1~0.base) 0))) (and (<= c_~i~0 .cse35) (<= .cse35 0) (not (= ~q1~0.base c_~q2~0.base))))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse36 (select .cse37 c_~q1~0.base))) (or (not (= (select .cse36 .cse21) c_~j~0)) (< (select .cse36 .cse24) .cse25) (< (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse39 (select .cse40 c_~q1~0.base))) (or (< (select .cse39 .cse24) c_~i~0) (not (= (select .cse39 .cse21) c_~j~0)) (< (select (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse23 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))) (not (= c_~i~0 (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse19 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse10 .cse29 .cse11 .cse12 .cse14 .cse15 .cse30 .cse31 .cse32) (<= c_~n2~0 1) (= c_~n1~0 1) .cse34 .cse33))) is different from false [2023-12-02 18:52:38,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (<= c_~q2_front~0 0)) (.cse5 (= c_~n2~0 1)) (.cse3 (not (= c_~q2_back~0 0))) (.cse0 (not (= c_~q2_front~0 0))) (.cse4 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base))) (.cse1 (= 0 (select (select |c_#memory_int| c_~q2~0.base) 0))) (.cse18 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse15 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse17 (* c_~q2_front~0 4)) (.cse19 (+ c_~i~0 1)) (.cse13 (* c_~q2_back~0 4)) (.cse6 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse23 (< c_~q2_back~0 0)) (.cse7 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse8 (< c_~q1_front~0 0)) (.cse10 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse11 (< c_~q1_back~0 0)) (.cse24 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse25 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse26 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (or .cse0 .cse1) (= c_~q1~0.offset 0) (= c_~i~0 0) .cse2 (or .cse3 (and .cse2 (or .cse0 .cse4)) (not .cse5)) .cse5 (<= 1 c_~N~0) (or .cse6 .cse0 .cse7 .cse8 (let ((.cse9 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse9)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse9) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse10 .cse11 .cse3) (or .cse0 (and .cse4 .cse1)) (or .cse6 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse16 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse14 (select .cse16 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse14 .cse15))) (< (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse14 .cse18) .cse19)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse22 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse21 (select .cse22 c_~q1~0.base))) (or (< (select .cse21 .cse18) c_~i~0) (not (= c_~j~0 (select .cse21 .cse15))) (< (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse19))))))))) .cse23 .cse7 .cse8 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse11 .cse24 .cse25 .cse26) (or (and (or (not (= c_~q1_front~0 0)) (= c_~j~0 0)) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse27 (select .cse28 c_~q1~0.base))) (or (not (= (select .cse27 .cse15) c_~j~0)) (< (select .cse27 .cse18) .cse19) (< (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse31 (store .cse32 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse30 (select .cse31 c_~q1~0.base))) (or (< (select .cse30 .cse18) c_~i~0) (not (= (select .cse30 .cse15) c_~j~0)) (< (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse19))))) (not (= c_~i~0 (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse6 .cse23 .cse7 .cse8 .cse10 .cse11 .cse24 .cse25 .cse26) (<= c_~n2~0 1) (= c_~n1~0 1))) is different from false [2023-12-02 18:52:39,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (not (= c_~q2_front~0 0))) (.cse3 (select |c_#memory_int| c_~q2~0.base)) (.cse5 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse17 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (* c_~q2_front~0 4)) (.cse19 (+ c_~i~0 1)) (.cse15 (* c_~q2_back~0 4)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse23 (< c_~q2_back~0 0)) (.cse10 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse6 (< c_~q1_front~0 0)) (.cse12 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse13 (< c_~q1_back~0 0)) (.cse24 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse7 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse8 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (= c_~q1~0.offset 0) (<= c_~q2_front~0 0) (= c_~n2~0 1) (<= 1 c_~N~0) (or .cse0 (let ((.cse2 (select (select |c_#memory_int| c_~q1~0.base) .cse5)) (.cse1 (select .cse3 (+ c_~q2~0.offset .cse4)))) (and (or (< .cse1 c_~N~0) (< (+ .cse2 1) c_~N~0)) (or (< .cse2 c_~N~0) (< (+ .cse1 1) c_~N~0)))) .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse6 (let ((.cse11 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse11)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse11) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse12 .cse13 (not (= c_~q2_back~0 0))) (or .cse9 (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q2~0.base)) (= 0 (select .cse3 0)))) (or .cse0 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse15 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse18 (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse16 (select .cse18 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse16 .cse17))) (< (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse16 .cse5) .cse19)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse15 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse22 (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse21 (select .cse22 c_~q1~0.base))) (or (< (select .cse21 .cse5) c_~i~0) (not (= c_~j~0 (select .cse21 .cse17))) (< (select (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse19))))))))) .cse23 .cse10 .cse6 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse13 .cse24 .cse7 .cse8) (or (and (or (not (= c_~q1_front~0 0)) (= c_~j~0 0)) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse25 (select .cse26 c_~q1~0.base))) (or (not (= (select .cse25 .cse17) c_~j~0)) (< (select .cse25 .cse5) .cse19) (< (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse15 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse29 (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse28 (select .cse29 c_~q1~0.base))) (or (< (select .cse28 .cse5) c_~i~0) (not (= (select .cse28 .cse17) c_~j~0)) (< (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse4 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse19))))) (not (= c_~i~0 (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse15 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse0 .cse23 .cse10 .cse6 .cse12 .cse13 .cse24 .cse7 .cse8) (= c_~n1~0 1))) is different from false [2023-12-02 18:52:40,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_~q2_front~0 4))) (let ((.cse0 (not (= c_~q2_front~0 0))) (.cse9 (+ c_~q2~0.offset .cse30)) (.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse12 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse23 (+ c_~i~0 1)) (.cse26 (* c_~q2_back~0 4)) (.cse2 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse19 (< c_~q2_back~0 0)) (.cse3 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse4 (< c_~q1_front~0 0)) (.cse18 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse5 (< c_~q1_back~0 0)) (.cse20 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse6 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse7 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (or .cse0 (= 0 (select .cse1 0))) (= c_~q1~0.offset 0) (<= c_~q2_front~0 0) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse10 (select .cse8 c_~q1~0.base))) (or (< (+ (select (select .cse8 c_~q2~0.base) .cse9) 1) c_~N~0) (not (= (select .cse10 .cse11) c_~j~0)) (< (select .cse10 .cse12) c_~N~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse13 (select .cse14 c_~q1~0.base))) (or (< (+ (select .cse13 .cse12) 1) c_~N~0) (not (= (select .cse13 .cse11) c_~j~0)) (< (select (select .cse14 c_~q2~0.base) .cse9) c_~N~0))))))) (= c_~n2~0 1) (<= 1 c_~N~0) (or .cse2 (let ((.cse16 (select (select |c_#memory_int| c_~q1~0.base) .cse12)) (.cse15 (select .cse1 .cse9))) (and (or (< .cse15 c_~N~0) (< (+ .cse16 1) c_~N~0)) (or (< .cse16 c_~N~0) (< (+ .cse15 1) c_~N~0)))) .cse4 .cse6 .cse7) (or .cse2 .cse0 .cse3 .cse4 (let ((.cse17 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse17)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse17) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse18 .cse5 (not (= c_~q2_back~0 0))) (or .cse2 .cse19 .cse3 .cse4 .cse5 .cse20 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse21 (select .cse22 c_~q1~0.base))) (or (not (= (select .cse21 .cse11) c_~j~0)) (< (select (select .cse22 c_~q2~0.base) .cse9) .cse23) (< (select .cse21 .cse12) c_~i~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse24 (select .cse25 c_~q1~0.base))) (or (< (select .cse24 .cse12) .cse23) (not (= (select .cse24 .cse11) c_~j~0)) (< (select (select .cse25 c_~q2~0.base) .cse9) c_~i~0)))))) .cse6 .cse7 (not (= c_~i~0 (select .cse1 (+ .cse26 c_~q2~0.offset))))) (or .cse2 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse29 (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse28 (select .cse29 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse28 .cse11))) (< (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse30 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse28 .cse12) .cse23)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse33 (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse32 (select .cse33 c_~q1~0.base))) (or (< (select .cse32 .cse12) c_~i~0) (not (= c_~j~0 (select .cse32 .cse11))) (< (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse30 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse23))))))))) .cse19 .cse3 .cse4 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse20 .cse6 .cse7) (or (and (or (not (= c_~q1_front~0 0)) (= c_~j~0 0)) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse35 (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse34 (select .cse35 c_~q1~0.base))) (or (not (= (select .cse34 .cse11) c_~j~0)) (< (select .cse34 .cse12) .cse23) (< (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse30 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse37 (select .cse38 c_~q1~0.base))) (or (< (select .cse37 .cse12) c_~i~0) (not (= (select .cse37 .cse11) c_~j~0)) (< (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse30 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse23))))) (not (= c_~i~0 (select (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7) (= c_~n1~0 1)))) is different from false [2023-12-02 18:52:46,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse26 (* c_~q2_back~0 4)) (.cse29 (* c_~q2_front~0 4))) (let ((.cse0 (not (= c_~q2_front~0 0))) (.cse11 (+ c_~q2~0.offset .cse29)) (.cse17 (not (= c_~i~0 (select .cse1 (+ .cse26 c_~q2~0.offset))))) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse13 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse22 (+ c_~i~0 1)) (.cse2 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse3 (< c_~q2_back~0 0)) (.cse4 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse5 (< c_~q1_front~0 0)) (.cse19 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (< c_~q1_back~0 0)) (.cse7 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse8 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse9 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (or .cse0 (= 0 (select .cse1 0))) (= c_~q1~0.offset 0) (<= c_~q2_front~0 0) (= c_~n2~0 1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse12 (select .cse10 c_~q1~0.base))) (or (< (+ (select (select .cse10 c_~q2~0.base) .cse11) 1) c_~N~0) (not (= (select .cse12 .cse13) c_~j~0)) (< (select .cse12 .cse14) c_~N~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse15 (select .cse16 c_~q1~0.base))) (or (< (+ (select .cse15 .cse14) 1) c_~N~0) (not (= (select .cse15 .cse13) c_~j~0)) (< (select (select .cse16 c_~q2~0.base) .cse11) c_~N~0)))))) .cse17) (<= 1 c_~N~0) (or .cse2 .cse0 .cse4 .cse5 (let ((.cse18 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse18)) (or (and (<= (+ c_~j~0 1) c_~i~0) .cse18) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse19 .cse6 (not (= c_~q2_back~0 0))) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse20 (select .cse21 c_~q1~0.base))) (or (not (= (select .cse20 .cse13) c_~j~0)) (< (select (select .cse21 c_~q2~0.base) .cse11) .cse22) (< (select .cse20 .cse14) c_~i~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse23 (select .cse24 c_~q1~0.base))) (or (< (select .cse23 .cse14) .cse22) (not (= (select .cse23 .cse13) c_~j~0)) (< (select (select .cse24 c_~q2~0.base) .cse11) c_~i~0)))))) .cse8 .cse9 .cse17) (or .cse2 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse28 (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse27 (select .cse28 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse27 .cse13))) (< (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse27 .cse14) .cse22)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse32 (store .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse31 (select .cse32 c_~q1~0.base))) (or (< (select .cse31 .cse14) c_~i~0) (not (= c_~j~0 (select .cse31 .cse13))) (< (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse22))))))))) .cse3 .cse4 .cse5 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7 .cse8 .cse9) (or (and (or (not (= c_~q1_front~0 0)) (= c_~j~0 0)) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse33 (select .cse34 c_~q1~0.base))) (or (not (= (select .cse33 .cse13) c_~j~0)) (< (select .cse33 .cse14) .cse22) (< (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse36 (select .cse37 c_~q1~0.base))) (or (< (select .cse36 .cse14) c_~i~0) (not (= (select .cse36 .cse13) c_~j~0)) (< (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse22))))) (not (= c_~i~0 (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse26 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9) (= c_~n1~0 1)))) is different from false [2023-12-02 18:52:50,024 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse32 (* c_~q2_front~0 4)) (.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse29 (* c_~q2_back~0 4)) (.cse4 (+ c_~j~0 1))) (let ((.cse0 (not (= c_~q2_front~0 0))) (.cse3 (<= .cse4 c_~i~0)) (.cse20 (not (= c_~i~0 (select .cse1 (+ .cse29 c_~q2~0.offset))))) (.cse17 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse16 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse5 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse6 (< c_~q2_back~0 0)) (.cse7 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse8 (< c_~q1_front~0 0)) (.cse22 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse9 (< c_~q1_back~0 0)) (.cse10 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse25 (+ c_~i~0 1)) (.cse2 (< c_~i~0 c_~N~0)) (.cse14 (+ c_~q2~0.offset .cse32)) (.cse11 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse12 (< c_~q2_front~0 0))) (and (= c_~q2~0.offset 0) (or .cse0 (= 0 (select .cse1 0))) (= c_~q1~0.offset 0) (<= c_~q2_front~0 0) (or .cse2 (and .cse3 (or (= c_~N~0 c_~i~0) (< .cse4 c_~N~0)))) (= c_~n2~0 1) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse15 (select .cse13 c_~q1~0.base))) (or (< (+ (select (select .cse13 c_~q2~0.base) .cse14) 1) c_~N~0) (not (= (select .cse15 .cse16) c_~j~0)) (< (select .cse15 .cse17) c_~N~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse18 (select .cse19 c_~q1~0.base))) (or (< (+ (select .cse18 .cse17) 1) c_~N~0) (not (= (select .cse18 .cse16) c_~j~0)) (< (select (select .cse19 c_~q2~0.base) .cse14) c_~N~0)))))) .cse20) (<= 1 c_~N~0) (or .cse5 .cse0 .cse7 .cse8 (let ((.cse21 (= c_~q1_back~0 c_~q1_front~0))) (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_158|) 0))) (and (<= c_~j~0 c_~i~0) .cse21)) (or (and .cse3 .cse21) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))))) .cse22 .cse9 (not (= c_~q2_back~0 0))) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse23 (select .cse24 c_~q1~0.base))) (or (not (= (select .cse23 .cse16) c_~j~0)) (< (select (select .cse24 c_~q2~0.base) .cse14) .cse25) (< (select .cse23 .cse17) c_~i~0))))) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse26 (select .cse27 c_~q1~0.base))) (or (< (select .cse26 .cse17) .cse25) (not (= (select .cse26 .cse16) c_~j~0)) (< (select (select .cse27 c_~q2~0.base) .cse14) c_~i~0)))))) .cse11 .cse12 .cse20) (or .cse5 (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse31 (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse30 (select .cse31 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse30 .cse16))) (< (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0) (< (select .cse30 .cse17) .cse25)))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int)) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (not (= (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0)) (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse35 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse34 (select .cse35 c_~q1~0.base))) (or (< (select .cse34 .cse17) c_~i~0) (not (= c_~j~0 (select .cse34 .cse16))) (< (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))))))) .cse6 .cse7 .cse8 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 .cse10 .cse11 .cse12) (or (and (or (not (= c_~q1_front~0 0)) (= c_~j~0 0)) (<= c_~q1_front~0 0)) (not (= c_~q1_back~0 0))) (or (and (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse36 (select .cse37 c_~q1~0.base))) (or (not (= (select .cse36 .cse16) c_~j~0)) (< (select .cse36 .cse17) .cse25) (< (select (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~i~0))))) (not (= c_~i~0 (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((v_ArrVal_325 (Array Int Int)) (|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_325))) (or (forall ((v_ArrVal_326 (Array Int Int))) (let ((.cse40 (store .cse41 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_326))) (let ((.cse39 (select .cse40 c_~q1~0.base))) (or (< (select .cse39 .cse17) c_~i~0) (not (= (select .cse39 .cse16) c_~j~0)) (< (select (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse25))))) (not (= c_~i~0 (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse29 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse10 .cse11 .cse12) (or (let ((.cse42 (select .cse1 .cse14))) (and (or (< .cse42 c_~N~0) (< .cse25 c_~N~0)) (or .cse2 (< (+ .cse42 1) c_~N~0)))) .cse11 .cse12) (= c_~n1~0 1)))) is different from false [2023-12-02 18:52:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:58,386 INFO L93 Difference]: Finished difference Result 1387 states and 3230 transitions. [2023-12-02 18:52:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-02 18:52:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:52:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:58,393 INFO L225 Difference]: With dead ends: 1387 [2023-12-02 18:52:58,393 INFO L226 Difference]: Without dead ends: 1369 [2023-12-02 18:52:58,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1424, Invalid=11884, Unknown=72, NotChecked=2370, Total=15750 [2023-12-02 18:52:58,395 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 386 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4170 mSolverCounterSat, 165 mSolverCounterUnsat, 98 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 5567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 4170 IncrementalHoareTripleChecker+Invalid, 98 IncrementalHoareTripleChecker+Unknown, 1134 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:58,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 285 Invalid, 5567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 4170 Invalid, 98 Unknown, 1134 Unchecked, 14.8s Time] [2023-12-02 18:52:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2023-12-02 18:52:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 698. [2023-12-02 18:52:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.5078909612625537) internal successors, (1748), 697 states have internal predecessors, (1748), 0 states have call successors, (0), 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 18:52:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1748 transitions. [2023-12-02 18:52:58,415 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1748 transitions. Word has length 26 [2023-12-02 18:52:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:58,415 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1748 transitions. [2023-12-02 18:52:58,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:52:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1748 transitions. [2023-12-02 18:52:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:52:58,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:58,417 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 18:52:58,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:52:58,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:58,618 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:52:58,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1604571849, now seen corresponding path program 8 times [2023-12-02 18:52:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:52:58,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849770815] [2023-12-02 18:52:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:52:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:00,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:53:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849770815] [2023-12-02 18:53:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849770815] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:53:00,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577217742] [2023-12-02 18:53:00,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:53:00,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:53:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:53:00,531 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:53:00,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:53:00,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:53:00,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:53:00,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 18:53:00,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:00,956 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 23 treesize of output 1 [2023-12-02 18:53:01,066 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 8 treesize of output 1 [2023-12-02 18:53:01,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:53:01,410 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 18:53:01,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:01,895 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 40 treesize of output 32 [2023-12-02 18:53:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:02,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:04,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:04,193 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 144 treesize of output 96 [2023-12-02 18:53:04,319 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 18:53:04,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1217 treesize of output 1137 [2023-12-02 18:53:04,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:04,410 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 461 treesize of output 475 [2023-12-02 18:53:04,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:53:04,465 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 388 treesize of output 308 [2023-12-02 18:53:33,820 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 18:53:33,820 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 118 treesize of output 1 [2023-12-02 18:53:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:53:34,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577217742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:53:34,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757759165] [2023-12-02 18:53:34,411 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 18:53:34,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:53:34,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 43 [2023-12-02 18:53:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680499413] [2023-12-02 18:53:34,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:53:34,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 18:53:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:53:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 18:53:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1746, Unknown=2, NotChecked=0, Total=1892 [2023-12-02 18:53:34,413 INFO L87 Difference]: Start difference. First operand 698 states and 1748 transitions. Second operand has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:53:34,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (let ((.cse2 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse3 (< c_~q2_back~0 0)) (.cse4 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse13 (< c_~q1_front~0 0)) (.cse14 (< c_~q1_back~0 0)) (.cse15 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse18 (= c_~q2_front~0 c_~q2_back~0)) (.cse0 (= c_~j~0 c_~i~0)) (.cse16 (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse19 (= c_~q1_back~0 c_~q1_front~0)) (.cse17 (<= c_~n1~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (and (<= 0 c_~i~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse0 (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 .cse3 .cse4 (let ((.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse8 (select .cse6 ~q1~0.base))) (let ((.cse5 (select .cse8 .cse10))) (or (< .cse5 c_~i~0) (< .cse5 (+ (select (select .cse6 c_~q2~0.base) .cse7) 1)) (not (= c_~j~0 (select .cse8 .cse9)))))))) (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse12 (select .cse11 ~q1~0.base))) (or (< (select (select .cse11 c_~q2~0.base) .cse7) (+ c_~i~0 1)) (< (select .cse12 .cse10) c_~i~0) (not (= c_~j~0 (select .cse12 .cse9))))))))) .cse13 .cse14 .cse15 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or (not (= c_~n2~0 1)) (and (= c_~i~0 0) (<= c_~q1_front~0 c_~q1_back~0) (<= c_~q2_front~0 c_~q2_back~0) .cse16 .cse17 (= c_~j~0 0))) .cse18 (or .cse2 .cse3 .cse4 .cse13 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14 .cse15 (and (or .cse18 (not .cse0)) (<= c_~j~0 c_~i~0) (or (< c_~j~0 c_~i~0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse19)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse16 (<= c_~j~0 0) .cse19 .cse17))) is different from false [2023-12-02 18:53:37,074 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse1 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse2 (< c_~q2_back~0 0)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse3 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse12 (< c_~q1_front~0 0)) (.cse13 (< c_~q1_back~0 0)) (.cse14 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse15 (not (= c_~i~0 (select .cse21 (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse0 (< c_~i~0 c_~N~0))) (and (or .cse0 (= c_~i~0 (+ c_~j~0 1))) (or (= c_~j~0 c_~i~0) .cse0) (or .cse1 .cse2 .cse3 (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse7 (select .cse5 ~q1~0.base))) (let ((.cse4 (select .cse7 .cse9))) (or (< .cse4 c_~i~0) (< .cse4 (+ (select (select .cse5 c_~q2~0.base) .cse6) 1)) (not (= c_~j~0 (select .cse7 .cse8)))))))) (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse6) (+ c_~i~0 1)) (< (select .cse11 .cse9) c_~i~0) (not (= c_~j~0 (select .cse11 .cse8)))))))) .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse18 (select .cse17 ~q1~0.base))) (let ((.cse16 (select .cse18 .cse9))) (or (< (+ .cse16 1) c_~N~0) (< .cse16 (+ (select (select .cse17 c_~q2~0.base) .cse6) 1)) (not (= c_~j~0 (select .cse18 .cse8)))))))) (forall ((v_ArrVal_361 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (or (< (select (select .cse19 c_~q2~0.base) .cse6) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse20 (select .cse19 ~q1~0.base))) (or (< (+ (select .cse20 .cse9) 1) c_~N~0) (not (= c_~j~0 (select .cse20 .cse8)))))))))) .cse3 .cse12 .cse13 .cse14 .cse15) (or (= c_~i~0 (+ (select .cse21 .cse6) 1)) .cse0)))) is different from false [2023-12-02 18:53:48,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (= c_~j~0 c_~i~0))) (let ((.cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse8 (not .cse20)) (.cse6 (<= c_~j~0 c_~i~0)) (.cse5 (< c_~j~0 c_~i~0)) (.cse7 (= c_~q1_back~0 c_~q1_front~0)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse9 (< c_~q2_back~0 0)) (.cse12 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse15 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse14 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse1 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse2 (< c_~q1_front~0 0)) (.cse4 (< c_~q1_back~0 0)) (.cse18 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse19 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))) (and (<= (+ c_~j~0 1) c_~N~0) (<= 1 c_~N~0) (<= c_~i~0 c_~N~0) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse5) .cse6 .cse7 (or (= c_~q2_front~0 0) .cse8)) (not (= c_~q2_back~0 0))) .cse6 (or .cse0 .cse9 .cse1 (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse13 (select .cse11 ~q1~0.base))) (let ((.cse10 (select .cse13 .cse15))) (or (< .cse10 c_~i~0) (< .cse10 (+ (select (select .cse11 c_~q2~0.base) .cse12) 1)) (not (= c_~j~0 (select .cse13 .cse14)))))))) (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select (select .cse16 c_~q2~0.base) .cse12) (+ c_~i~0 1)) (< (select .cse17 .cse15) c_~i~0) (not (= c_~j~0 (select .cse17 .cse14)))))))) .cse2 .cse4 .cse18 .cse19) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse18 (and (or (= c_~q2_front~0 c_~q2_back~0) .cse8) .cse6 (or .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse7)) (or .cse20 (< c_~i~0 (+ c_~N~0 1))) (or .cse0 .cse9 (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse23 (select .cse22 ~q1~0.base))) (let ((.cse21 (select .cse23 .cse15))) (or (< (+ .cse21 1) c_~N~0) (< .cse21 (+ (select (select .cse22 c_~q2~0.base) .cse12) 1)) (not (= c_~j~0 (select .cse23 .cse14)))))))) (forall ((v_ArrVal_361 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (or (< (select (select .cse24 c_~q2~0.base) .cse12) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse25 (select .cse24 ~q1~0.base))) (or (< (+ (select .cse25 .cse15) 1) c_~N~0) (not (= c_~j~0 (select .cse25 .cse14)))))))))) .cse1 .cse2 .cse4 .cse18 .cse19) (<= 0 c_~j~0) (<= c_~i~0 1) (= c_~j~0 0)))) is different from false [2023-12-02 18:53:51,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_~q2~0.base)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse0 (< c_~i~0 c_~N~0))) (and (or .cse0 (= c_~i~0 (+ c_~j~0 1))) (or (= c_~j~0 c_~i~0) .cse0) (or (< c_~n1~0 (+ c_~q1_front~0 1)) (< c_~q2_back~0 0) (let ((.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (and (forall ((~q1~0.base Int) (v_ArrVal_361 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (let ((.cse4 (select .cse2 ~q1~0.base))) (let ((.cse1 (select .cse4 .cse6))) (or (< (+ .cse1 1) c_~N~0) (< .cse1 (+ (select (select .cse2 c_~q2~0.base) .cse3) 1)) (not (= c_~j~0 (select .cse4 .cse5)))))))) (forall ((v_ArrVal_361 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_361))) (or (< (select (select .cse7 c_~q2~0.base) .cse3) c_~N~0) (forall ((~q1~0.base Int)) (let ((.cse8 (select .cse7 ~q1~0.base))) (or (< (+ (select .cse8 .cse6) 1) c_~N~0) (not (= c_~j~0 (select .cse8 .cse5))))))))))) (< c_~n1~0 (+ c_~q1_back~0 1)) (< c_~q1_front~0 0) (< c_~q1_back~0 0) (< c_~n2~0 (+ c_~q2_back~0 1)) (not (= c_~i~0 (select .cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset))))) (or (= c_~i~0 (+ (select .cse9 .cse3) 1)) .cse0))) is different from false [2023-12-02 18:54:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:06,151 INFO L93 Difference]: Finished difference Result 1375 states and 3286 transitions. [2023-12-02 18:54:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-12-02 18:54:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:54:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:06,159 INFO L225 Difference]: With dead ends: 1375 [2023-12-02 18:54:06,160 INFO L226 Difference]: Without dead ends: 1365 [2023-12-02 18:54:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3202 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=1762, Invalid=11278, Unknown=86, NotChecked=916, Total=14042 [2023-12-02 18:54:06,161 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 570 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 281 mSolverCounterUnsat, 85 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 85 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:06,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 281 Invalid, 3754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2890 Invalid, 85 Unknown, 498 Unchecked, 6.7s Time] [2023-12-02 18:54:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-12-02 18:54:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 724. [2023-12-02 18:54:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 2.5269709543568464) internal successors, (1827), 723 states have internal predecessors, (1827), 0 states have call successors, (0), 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 18:54:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1827 transitions. [2023-12-02 18:54:06,184 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1827 transitions. Word has length 26 [2023-12-02 18:54:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:06,184 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 1827 transitions. [2023-12-02 18:54:06,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 18:54:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1827 transitions. [2023-12-02 18:54:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:54:06,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:06,187 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 18:54:06,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 18:54:06,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 18:54:06,392 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:54:06,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -712397143, now seen corresponding path program 9 times [2023-12-02 18:54:06,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:54:06,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146142746] [2023-12-02 18:54:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:54:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:54:08,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:54:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146142746] [2023-12-02 18:54:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146142746] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:54:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107547495] [2023-12-02 18:54:08,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:54:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:54:08,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:54:08,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:54:08,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 18:54:08,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:54:08,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:54:08,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:54:08,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:08,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:54:08,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 18 treesize of output 13 [2023-12-02 18:54:09,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:54:09,355 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 43 treesize of output 35 [2023-12-02 18:54:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:54:09,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:10,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (* c_~q1_back~0 4)) (.cse4 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_394 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394))) (or (< (+ (select (select .cse0 c_~q2~0.base) .cse1) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< c_~N~0 (+ (select .cse2 (+ .cse3 ~q1~0.offset)) 1)) (< (select .cse2 (+ .cse4 ~q1~0.offset)) c_~N~0))))))) (forall ((v_ArrVal_394 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394))) (or (< (select (select .cse5 c_~q2~0.base) .cse1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (< c_~N~0 (+ (select .cse6 (+ .cse3 ~q1~0.offset)) 1)) (< (+ (select .cse6 (+ .cse4 ~q1~0.offset)) 1) c_~N~0))))))))) is different from false [2023-12-02 18:54:10,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:54:10,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 206 treesize of output 386 [2023-12-02 18:54:10,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:54:10,842 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 145 treesize of output 168 [2023-12-02 18:54:10,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:54:10,906 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 127 treesize of output 150 [2023-12-02 18:54:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:54:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107547495] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:54:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1467851826] [2023-12-02 18:54:38,863 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 18:54:38,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:54:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2023-12-02 18:54:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684515966] [2023-12-02 18:54:38,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:54:38,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 18:54:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:54:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 18:54:38,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1751, Unknown=1, NotChecked=84, Total=1980 [2023-12-02 18:54:38,865 INFO L87 Difference]: Start difference. First operand 724 states and 1827 transitions. Second operand has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:54:46,609 WARN L539 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 18:54:58,338 WARN L539 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 18:55:00,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 [1] [2023-12-02 18:55:02,356 WARN L539 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 18:55:09,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:55:11,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:55:14,631 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 18:55:16,868 WARN L539 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 18:55:18,875 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 18:55:21,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:55:23,535 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 18:55:25,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:55:27,665 WARN L539 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 18:55:29,673 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 18:55:32,212 WARN L539 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 18:55:34,220 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 18:55:37,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 [1] [2023-12-02 18:55:39,048 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 18:55:41,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:55:43,212 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 18:55:45,944 WARN L539 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 18:55:48,279 WARN L539 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 18:55:50,327 WARN L539 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 18:55:52,357 WARN L539 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 18:55:54,374 WARN L539 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 18:55:57,045 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 18:55:59,056 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 18:56:01,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 18:56:03,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 [1] [2023-12-02 18:56:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:56:03,825 INFO L93 Difference]: Finished difference Result 1494 states and 3582 transitions. [2023-12-02 18:56:03,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-12-02 18:56:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:56:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:56:03,834 INFO L225 Difference]: With dead ends: 1494 [2023-12-02 18:56:03,835 INFO L226 Difference]: Without dead ends: 1471 [2023-12-02 18:56:03,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8383 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=2777, Invalid=23931, Unknown=28, NotChecked=324, Total=27060 [2023-12-02 18:56:03,838 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1308 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 2822 mSolverCounterSat, 330 mSolverCounterUnsat, 108 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2822 IncrementalHoareTripleChecker+Invalid, 108 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 67.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:56:03,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 222 Invalid, 3845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2822 Invalid, 108 Unknown, 585 Unchecked, 67.7s Time] [2023-12-02 18:56:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2023-12-02 18:56:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 827. [2023-12-02 18:56:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 2.5786924939467313) internal successors, (2130), 826 states have internal predecessors, (2130), 0 states have call successors, (0), 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 18:56:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2130 transitions. [2023-12-02 18:56:03,872 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2130 transitions. Word has length 26 [2023-12-02 18:56:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:56:03,873 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 2130 transitions. [2023-12-02 18:56:03,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:56:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2130 transitions. [2023-12-02 18:56:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:56:03,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:56:03,876 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 18:56:03,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 18:56:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 18:56:04,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:56:04,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:56:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1749441531, now seen corresponding path program 10 times [2023-12-02 18:56:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:56:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062176072] [2023-12-02 18:56:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:56:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:56:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:56:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:56:05,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:56:05,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062176072] [2023-12-02 18:56:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062176072] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:56:05,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141235200] [2023-12-02 18:56:05,895 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:56:05,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:56:05,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:56:05,897 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:56:05,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 18:56:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:56:05,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-02 18:56:05,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:56:06,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:56:06,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:56:06,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 18:56:06,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:56:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-02 18:56:06,164 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 18:56:06,296 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 18:56:06,296 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 11 treesize of output 11 [2023-12-02 18:56:06,414 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 8 treesize of output 1 [2023-12-02 18:56:06,500 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 8 treesize of output 1 [2023-12-02 18:56:06,769 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 8 treesize of output 1 [2023-12-02 18:56:07,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:56:07,392 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 52 treesize of output 36 [2023-12-02 18:56:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:56:07,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:56:10,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:56:10,879 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 133 treesize of output 97 [2023-12-02 18:56:11,025 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2023-12-02 18:56:11,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 923 treesize of output 962 [2023-12-02 18:56:11,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:56:11,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:56:11,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 575 treesize of output 551 [2023-12-02 18:56:11,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:56:11,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:56:11,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 479 treesize of output 503 [2023-12-02 18:56:11,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:56:11,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:56:11,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 329 treesize of output 377 [2023-12-02 18:57:14,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:57:14,864 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 133 treesize of output 97 [2023-12-02 18:57:15,018 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 18:57:15,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1255 treesize of output 1279 [2023-12-02 18:57:15,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:57:15,126 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 497 treesize of output 529 [2023-12-02 18:57:15,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:57:15,218 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 390 treesize of output 446 [2023-12-02 18:57:15,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:57:15,323 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 448 treesize of output 432 [2023-12-02 18:59:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:59:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141235200] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:59:18,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [15742997] [2023-12-02 18:59:18,855 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 18:59:18,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:59:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2023-12-02 18:59:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85158642] [2023-12-02 18:59:18,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:59:18,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-02 18:59:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:59:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-02 18:59:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1778, Unknown=18, NotChecked=0, Total=1980 [2023-12-02 18:59:18,857 INFO L87 Difference]: Start difference. First operand 827 states and 2130 transitions. Second operand has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:59:33,117 WARN L539 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 18:59:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:59:56,765 INFO L93 Difference]: Finished difference Result 1628 states and 3968 transitions. [2023-12-02 18:59:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-12-02 18:59:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 18:59:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:59:56,775 INFO L225 Difference]: With dead ends: 1628 [2023-12-02 18:59:56,775 INFO L226 Difference]: Without dead ends: 1603 [2023-12-02 18:59:56,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5622 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=2438, Invalid=17504, Unknown=80, NotChecked=0, Total=20022 [2023-12-02 18:59:56,777 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 693 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 3281 mSolverCounterSat, 226 mSolverCounterUnsat, 119 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 3281 IncrementalHoareTripleChecker+Invalid, 119 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:59:56,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 236 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 3281 Invalid, 119 Unknown, 0 Unchecked, 11.6s Time] [2023-12-02 18:59:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2023-12-02 18:59:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 980. [2023-12-02 18:59:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 2.5975485188968337) internal successors, (2543), 979 states have internal predecessors, (2543), 0 states have call successors, (0), 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 18:59:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2543 transitions. [2023-12-02 18:59:56,814 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2543 transitions. Word has length 26 [2023-12-02 18:59:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:59:56,815 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 2543 transitions. [2023-12-02 18:59:56,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:59:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2543 transitions. [2023-12-02 18:59:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:59:56,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:59:56,817 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 18:59:56,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 18:59:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 18:59:57,018 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 18:59:57,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:59:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 618589059, now seen corresponding path program 11 times [2023-12-02 18:59:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:59:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849235811] [2023-12-02 18:59:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:59:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:59:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:59:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:59:58,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:59:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849235811] [2023-12-02 18:59:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849235811] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:59:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476806133] [2023-12-02 18:59:58,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:59:58,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:59:58,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:59:58,727 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:59:58,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 18:59:58,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 18:59:58,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:59:58,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 18:59:58,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:59:59,260 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 23 treesize of output 1 [2023-12-02 18:59:59,385 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 8 treesize of output 1 [2023-12-02 18:59:59,653 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 8 treesize of output 1 [2023-12-02 19:00:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:00:00,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:00:03,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:00:03,218 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 147 treesize of output 99 [2023-12-02 19:00:03,358 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-02 19:00:03,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1257 treesize of output 1177 [2023-12-02 19:00:03,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:00:03,468 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 501 treesize of output 515 [2023-12-02 19:00:03,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:00:03,558 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 446 treesize of output 394 [2023-12-02 19:01:12,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:01:12,131 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 121 treesize of output 85 [2023-12-02 19:01:12,195 INFO L349 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-12-02 19:01:12,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 615 treesize of output 574 [2023-12-02 19:01:12,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:01:12,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:01:12,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:01:12,246 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 179 [2023-12-02 19:01:12,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:01:12,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 19:01:12,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:01:12,286 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 185 treesize of output 153 [2023-12-02 19:01:13,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:01:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476806133] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:01:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956743357] [2023-12-02 19:01:13,485 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:01:13,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:01:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2023-12-02 19:01:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892298988] [2023-12-02 19:01:13,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:01:13,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 19:01:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:01:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 19:01:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1605, Unknown=5, NotChecked=0, Total=1806 [2023-12-02 19:01:13,487 INFO L87 Difference]: Start difference. First operand 980 states and 2543 transitions. Second operand has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:01:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:01:54,311 INFO L93 Difference]: Finished difference Result 2251 states and 5496 transitions. [2023-12-02 19:01:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2023-12-02 19:01:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:01:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:01:54,322 INFO L225 Difference]: With dead ends: 2251 [2023-12-02 19:01:54,323 INFO L226 Difference]: Without dead ends: 2231 [2023-12-02 19:01:54,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9757 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=3201, Invalid=24815, Unknown=40, NotChecked=0, Total=28056 [2023-12-02 19:01:54,324 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 656 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 224 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 4931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-02 19:01:54,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 285 Invalid, 4931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 4651 Invalid, 56 Unknown, 0 Unchecked, 9.4s Time] [2023-12-02 19:01:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2023-12-02 19:01:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1143. [2023-12-02 19:01:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 2.6330998248686517) internal successors, (3007), 1142 states have internal predecessors, (3007), 0 states have call successors, (0), 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:01:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 3007 transitions. [2023-12-02 19:01:54,363 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 3007 transitions. Word has length 26 [2023-12-02 19:01:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:01:54,363 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 3007 transitions. [2023-12-02 19:01:54,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:01:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 3007 transitions. [2023-12-02 19:01:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:01:54,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:01:54,367 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:01:54,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 19:01:54,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 19:01:54,568 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 19:01:54,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:01:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 75481949, now seen corresponding path program 12 times [2023-12-02 19:01:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:01:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614206163] [2023-12-02 19:01:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:01:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:01:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:01:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:01:56,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:01:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614206163] [2023-12-02 19:01:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614206163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 19:01:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157101404] [2023-12-02 19:01:56,360 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 19:01:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:01:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:01:56,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:01:56,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 19:01:56,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 19:01:56,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:01:56,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 19:01:56,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:01:57,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:01:57,098 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 46 treesize of output 34 [2023-12-02 19:01:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:01:57,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:01:58,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 19:01:58,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 270 [2023-12-02 19:02:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:02:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157101404] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:02:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1611404539] [2023-12-02 19:02:06,153 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:02:06,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 19:02:06,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2023-12-02 19:02:06,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444043897] [2023-12-02 19:02:06,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 19:02:06,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 19:02:06,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:02:06,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 19:02:06,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 19:02:06,154 INFO L87 Difference]: Start difference. First operand 1143 states and 3007 transitions. Second operand has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:02:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:02:11,372 INFO L93 Difference]: Finished difference Result 1548 states and 3943 transitions. [2023-12-02 19:02:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-02 19:02:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 19:02:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:02:11,383 INFO L225 Difference]: With dead ends: 1548 [2023-12-02 19:02:11,384 INFO L226 Difference]: Without dead ends: 1538 [2023-12-02 19:02:11,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=647, Invalid=4903, Unknown=0, NotChecked=0, Total=5550 [2023-12-02 19:02:11,385 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 271 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 19:02:11,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 175 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 19:02:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2023-12-02 19:02:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1159. [2023-12-02 19:02:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 2.6303972366148534) internal successors, (3046), 1158 states have internal predecessors, (3046), 0 states have call successors, (0), 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:02:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 3046 transitions. [2023-12-02 19:02:11,417 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 3046 transitions. Word has length 26 [2023-12-02 19:02:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:02:11,417 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 3046 transitions. [2023-12-02 19:02:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:02:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 3046 transitions. [2023-12-02 19:02:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 19:02:11,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:02:11,419 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:02:11,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 19:02:11,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c8bcc19-73a4-450c-b083-9c48b7f6c9bd/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 19:02:11,620 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 19:02:11,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:02:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1631281591, now seen corresponding path program 13 times [2023-12-02 19:02:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:02:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161493928] [2023-12-02 19:02:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:02:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:02:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat