./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.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_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91 --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 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:06:44,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:06:44,673 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:06:44,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:06:44,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:06:44,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:06:44,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:06:44,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:06:44,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:06:44,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:06:44,734 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:06:44,735 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:06:44,736 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:06:44,738 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:06:44,738 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:06:44,739 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:06:44,739 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:06:44,739 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:06:44,740 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:06:44,740 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:06:44,741 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:06:44,741 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:06:44,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:06:44,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:06:44,743 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:06:44,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:06:44,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:06:44,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:06:44,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:06:44,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:06:44,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:06:44,747 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:06:44,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:06:44,747 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:06:44,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:06:44,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:06:44,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:06:44,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:06:44,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:06:44,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:06:44,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:06:44,749 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:06:44,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:06:44,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:06:44,751 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:06:44,751 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:06:44,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:06:44,751 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_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/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_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91 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 -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2023-11-25 00:06:45,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:06:45,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:06:45,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:06:45,101 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:06:45,101 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:06:45,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-11-25 00:06:48,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:06:48,536 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:06:48,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2023-11-25 00:06:48,544 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/data/de1d2de45/97556f445d82447489050362009a37fd/FLAG3daccd088 [2023-11-25 00:06:48,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/data/de1d2de45/97556f445d82447489050362009a37fd [2023-11-25 00:06:48,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:06:48,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:06:48,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:06:48,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:06:48,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:06:48,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765495bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48, skipping insertion in model container [2023-11-25 00:06:48,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:06:48,825 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_64e9d195-2e3b-4f5b-a540-3c665186c0f6/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-25 00:06:48,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:06:48,846 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:06:48,871 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_64e9d195-2e3b-4f5b-a540-3c665186c0f6/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-11-25 00:06:48,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:06:48,884 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:06:48,884 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:06:48,893 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:06:48,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48 WrapperNode [2023-11-25 00:06:48,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:06:48,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:06:48,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:06:48,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:06:48,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,937 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-25 00:06:48,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:06:48,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:06:48,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:06:48,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:06:48,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:06:48,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:06:48,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:06:48,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:06:48,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (1/1) ... [2023-11-25 00:06:48,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:06:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:49,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:06:49,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:06:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:06:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-25 00:06:49,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-25 00:06:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-25 00:06:49,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-25 00:06:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-25 00:06:49,052 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-25 00:06:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:06:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:06:49,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:06:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:06:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:06:49,056 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:06:49,165 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:06:49,167 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:06:49,489 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:06:49,841 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:06:49,841 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-25 00:06:49,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:06:49 BoogieIcfgContainer [2023-11-25 00:06:49,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:06:49,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:06:49,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:06:49,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:06:49,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:06:48" (1/3) ... [2023-11-25 00:06:49,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c52ee68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:06:49, skipping insertion in model container [2023-11-25 00:06:49,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:48" (2/3) ... [2023-11-25 00:06:49,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c52ee68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:06:49, skipping insertion in model container [2023-11-25 00:06:49,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:06:49" (3/3) ... [2023-11-25 00:06:49,857 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-25 00:06:49,869 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-25 00:06:49,881 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:06:49,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:06:49,881 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:06:49,961 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-25 00:06:50,003 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2023-11-25 00:06:50,108 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 0 states have call successors, (0), 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-11-25 00:06:50,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:06:50,132 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;@3e75e216, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:06:50,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-25 00:06:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 0 states have call successors, (0), 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-11-25 00:06:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:06:50,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:50,153 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] [2023-11-25 00:06:50,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:06:50,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:50,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1975033521, now seen corresponding path program 1 times [2023-11-25 00:06:50,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:50,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600178655] [2023-11-25 00:06:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:50,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:50,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600178655] [2023-11-25 00:06:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600178655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:50,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:50,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:06:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991964014] [2023-11-25 00:06:50,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:06:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:06:50,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:50,813 INFO L87 Difference]: Start difference. First operand has 376 states, 375 states have (on average 3.2586666666666666) internal successors, (1222), 375 states have internal predecessors, (1222), 0 states have call successors, (0), 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 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:50,947 INFO L93 Difference]: Finished difference Result 377 states and 1223 transitions. [2023-11-25 00:06:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:06:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-25 00:06:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:50,968 INFO L225 Difference]: With dead ends: 377 [2023-11-25 00:06:50,969 INFO L226 Difference]: Without dead ends: 377 [2023-11-25 00:06:50,970 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-11-25 00:06:50,974 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:50,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-25 00:06:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2023-11-25 00:06:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.252659574468085) internal successors, (1223), 376 states have internal predecessors, (1223), 0 states have call successors, (0), 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-11-25 00:06:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1223 transitions. [2023-11-25 00:06:51,060 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1223 transitions. Word has length 21 [2023-11-25 00:06:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:51,060 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 1223 transitions. [2023-11-25 00:06:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1223 transitions. [2023-11-25 00:06:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-25 00:06:51,066 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:51,066 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] [2023-11-25 00:06:51,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:06:51,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:06:51,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 492711160, now seen corresponding path program 1 times [2023-11-25 00:06:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:51,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939740083] [2023-11-25 00:06:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:51,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:51,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939740083] [2023-11-25 00:06:51,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939740083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373527413] [2023-11-25 00:06:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:51,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:51,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:51,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:51,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:06:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:51,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-25 00:06:51,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:51,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:51,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373527413] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:51,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:06:51,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-25 00:06:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083003566] [2023-11-25 00:06:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:06:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:51,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:06:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:06:51,588 INFO L87 Difference]: Start difference. First operand 377 states and 1223 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:51,698 INFO L93 Difference]: Finished difference Result 439 states and 1432 transitions. [2023-11-25 00:06:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:06:51,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-25 00:06:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:51,705 INFO L225 Difference]: With dead ends: 439 [2023-11-25 00:06:51,705 INFO L226 Difference]: Without dead ends: 439 [2023-11-25 00:06:51,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:06:51,707 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-11-25 00:06:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2023-11-25 00:06:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.269406392694064) internal successors, (1432), 438 states have internal predecessors, (1432), 0 states have call successors, (0), 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-11-25 00:06:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1432 transitions. [2023-11-25 00:06:51,744 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1432 transitions. Word has length 22 [2023-11-25 00:06:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:51,745 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 1432 transitions. [2023-11-25 00:06:51,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1432 transitions. [2023-11-25 00:06:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:06:51,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:51,749 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-11-25 00:06:51,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:06:51,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-25 00:06:51,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:06:51,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -596567879, now seen corresponding path program 1 times [2023-11-25 00:06:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386245587] [2023-11-25 00:06:51,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:51,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-25 00:06:52,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:52,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386245587] [2023-11-25 00:06:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386245587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:52,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:06:52,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903220001] [2023-11-25 00:06:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:06:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:06:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:06:52,119 INFO L87 Difference]: Start difference. First operand 439 states and 1432 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-11-25 00:06:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:52,229 INFO L93 Difference]: Finished difference Result 511 states and 1676 transitions. [2023-11-25 00:06:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:06:52,229 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-11-25 00:06:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:52,235 INFO L225 Difference]: With dead ends: 511 [2023-11-25 00:06:52,236 INFO L226 Difference]: Without dead ends: 511 [2023-11-25 00:06:52,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:06:52,238 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:52,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-11-25 00:06:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2023-11-25 00:06:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.2862745098039214) internal successors, (1676), 510 states have internal predecessors, (1676), 0 states have call successors, (0), 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-11-25 00:06:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1676 transitions. [2023-11-25 00:06:52,267 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1676 transitions. Word has length 25 [2023-11-25 00:06:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:52,267 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1676 transitions. [2023-11-25 00:06:52,267 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-11-25 00:06:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1676 transitions. [2023-11-25 00:06:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:06:52,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:52,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:52,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:06:52,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:06:52,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:52,272 INFO L85 PathProgramCache]: Analyzing trace with hash -922026908, now seen corresponding path program 1 times [2023-11-25 00:06:52,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491609654] [2023-11-25 00:06:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:54,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491609654] [2023-11-25 00:06:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491609654] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:54,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945743764] [2023-11-25 00:06:54,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:54,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:54,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:54,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:54,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:06:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:54,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-25 00:06:54,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:54,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:54,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-11-25 00:06:54,460 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 15 treesize of output 1 [2023-11-25 00:06:54,549 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-11-25 00:06:54,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:54,949 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 36 treesize of output 27 [2023-11-25 00:06:55,089 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 36 treesize of output 27 [2023-11-25 00:06:55,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 40 [2023-11-25 00:06:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:55,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:56,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max3~0 1)) (.cse5 (+ c_~max2~0 1)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (and (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse1 .cse2) (= c_~max1~0 .cse1)))) (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse4 .cse2) (< c_~max2~0 .cse4)))))) (or (and (= c_~max1~0 c_~max3~0) (<= .cse5 c_~max3~0)) (and .cse0 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_101 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3)))) (forall ((v_ArrVal_101 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse3))) (or (< .cse6 .cse2) (< .cse6 .cse5) (= c_~max1~0 .cse6)))))) is different from false [2023-11-25 00:06:59,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:06:59,551 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-11-25 00:06:59,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:06:59,579 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 2777 treesize of output 2525 [2023-11-25 00:06:59,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:06:59,677 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 283 treesize of output 263 [2023-11-25 00:06:59,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 142 [2023-11-25 00:06:59,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 139 [2023-11-25 00:07:00,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,303 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 113 treesize of output 77 [2023-11-25 00:07:00,311 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,325 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 109 treesize of output 89 [2023-11-25 00:07:00,347 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,347 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 47 treesize of output 35 [2023-11-25 00:07:00,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,402 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 123 treesize of output 87 [2023-11-25 00:07:00,410 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,411 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,423 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,424 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 117 treesize of output 93 [2023-11-25 00:07:00,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,450 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 51 treesize of output 35 [2023-11-25 00:07:00,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,517 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 79 treesize of output 55 [2023-11-25 00:07:00,526 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,544 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 76 treesize of output 64 [2023-11-25 00:07:00,566 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,566 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 34 treesize of output 28 [2023-11-25 00:07:00,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-25 00:07:00,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,651 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,652 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 84 treesize of output 68 [2023-11-25 00:07:00,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,686 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 38 treesize of output 28 [2023-11-25 00:07:00,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,720 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 89 treesize of output 65 [2023-11-25 00:07:00,727 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,742 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,745 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 84 treesize of output 68 [2023-11-25 00:07:00,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,781 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 40 treesize of output 30 [2023-11-25 00:07:00,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:00,829 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 101 treesize of output 65 [2023-11-25 00:07:00,839 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,855 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 97 treesize of output 81 [2023-11-25 00:07:00,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,907 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 43 treesize of output 35 [2023-11-25 00:07:00,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07: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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-25 00:07:00,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:00,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:00,981 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 76 treesize of output 64 [2023-11-25 00:07:01,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:01,008 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 34 treesize of output 28 [2023-11-25 00:07:01,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:01,081 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 55 treesize of output 43 [2023-11-25 00:07:01,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:01,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:01,105 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:01,106 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 51 treesize of output 43 [2023-11-25 00:07:01,129 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:01,130 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 27 treesize of output 23 [2023-11-25 00:07:01,178 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:01,179 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 132 treesize of output 1 [2023-11-25 00:07:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945743764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:01,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [368255918] [2023-11-25 00:07:01,407 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-11-25 00:07:01,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-11-25 00:07:01,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623467566] [2023-11-25 00:07:01,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:01,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-25 00:07:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-25 00:07:01,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=521, Unknown=10, NotChecked=48, Total=702 [2023-11-25 00:07:01,419 INFO L87 Difference]: Start difference. First operand 511 states and 1676 transitions. Second operand has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 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-11-25 00:07:03,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max2~0 1))) (let ((.cse4 (+ c_~max3~0 1)) (.cse5 (= c_~max1~0 c_~max2~0)) (.cse12 (<= c_~max3~0 c_~max2~0)) (.cse8 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse25 (= c_~max1~0 c_~max3~0)) (.cse14 (<= .cse2 c_~max3~0))) (let ((.cse19 (and .cse25 .cse14)) (.cse13 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8)))) (.cse20 (and .cse5 .cse12)) (.cse11 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse30 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse30 .cse4) (< c_~max2~0 .cse30)))))) (let ((.cse27 (select |c_#memory_int| c_~A~0.base)) (.cse16 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse29 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (= c_~max1~0 .cse29) (< .cse29 .cse4) (< .cse29 .cse2))))) (.cse17 (or .cse5 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (= c_~max1~0 .cse28) (< .cse28 .cse4)))) .cse11))) (.cse21 (or .cse19 .cse13 .cse20))) (let ((.cse0 (and .cse16 .cse17 .cse21)) (.cse1 (select .cse27 c_~A~0.offset)) (.cse18 (select .cse27 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4)))) (.cse6 (select .cse27 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse15 (+ c_~max1~0 1)) (.cse3 (select .cse27 .cse8))) (and (or .cse0 (< c_~max1~0 .cse1)) (or (and (<= .cse2 .cse3) (= c_~max1~0 .cse3)) (< .cse3 .cse4) (and .cse5 (<= .cse3 c_~max2~0))) (or (< c_~max1~0 .cse6) .cse0) (or (let ((.cse9 (= .cse1 c_~max2~0))) (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse7 .cse4) (< .cse7 .cse2) (= .cse1 .cse7)))) (or .cse9 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse10 .cse4) (= .cse1 .cse10)))) .cse11)) (or (and .cse9 .cse12) .cse13 (and (= .cse1 c_~max3~0) .cse14)))) (< .cse1 .cse15)) .cse16 .cse17 (or (and (<= .cse18 c_~max2~0) .cse5) (and (= c_~max1~0 .cse18) (<= .cse2 .cse18)) (< .cse18 .cse4)) (or .cse19 .cse20 (< c_~max3~0 .cse18)) .cse21 (or (let ((.cse22 (= .cse6 c_~max2~0))) (and (or (and .cse14 (= .cse6 c_~max3~0)) .cse13 (and .cse12 .cse22)) (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse23 .cse4) (= .cse6 .cse23) (< .cse23 .cse2)))) (or (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse24 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse8))) (or (< .cse24 .cse4) (= .cse6 .cse24)))) .cse11) .cse22))) (< .cse6 .cse15)) (or .cse19 (< c_~max3~0 .cse3) .cse20) (let ((.cse26 (= c_~max2~0 0))) (or (and .cse25 (<= 1 c_~max3~0) .cse26) (and (= c_~max1~0 0) .cse26 (= c_~max3~0 0)))))))))) is different from false [2023-11-25 00:07:03,806 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~max2~0 1))) (let ((.cse6 (+ c_~max3~0 1)) (.cse7 (= c_~max1~0 c_~max2~0)) (.cse13 (<= c_~max3~0 c_~max2~0)) (.cse9 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse18 (= c_~max1~0 c_~max3~0)) (.cse15 (<= .cse4 c_~max3~0))) (let ((.cse16 (and .cse18 .cse15)) (.cse14 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9)))) (.cse17 (and .cse7 .cse13)) (.cse12 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse23 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9))) (or (< .cse23 .cse6) (< c_~max2~0 .cse23))))) (.cse20 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (select .cse20 c_~A~0.offset)) (.cse0 (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9))) (or (= c_~max1~0 .cse22) (< .cse22 .cse6) (< .cse22 .cse4))))) (.cse1 (or .cse7 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse21 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9))) (or (= c_~max1~0 .cse21) (< .cse21 .cse6)))) .cse12))) (.cse2 (or .cse16 .cse14 .cse17)) (.cse5 (select .cse20 .cse9))) (and (or (and .cse0 .cse1 .cse2) (< c_~max1~0 .cse3)) (or (and (<= .cse4 .cse5) (= c_~max1~0 .cse5)) (< .cse5 .cse6) (and .cse7 (<= .cse5 c_~max2~0))) (or (let ((.cse10 (= .cse3 c_~max2~0))) (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9))) (or (< .cse8 .cse6) (< .cse8 .cse4) (= .cse3 .cse8)))) (or .cse10 (and (forall ((v_ArrVal_100 (Array Int Int)) (v_ArrVal_101 (Array Int Int))) (let ((.cse11 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_101) c_~A~0.base) .cse9))) (or (< .cse11 .cse6) (= .cse3 .cse11)))) .cse12)) (or (and .cse10 .cse13) .cse14 (and (= .cse3 c_~max3~0) .cse15)))) (< .cse3 (+ c_~max1~0 1))) .cse0 .cse1 .cse2 (or .cse16 (< c_~max3~0 .cse5) .cse17) (let ((.cse19 (= c_~max2~0 0))) (or (and .cse18 (<= 1 c_~max3~0) .cse19) (and (= c_~max1~0 0) .cse19 (= c_~max3~0 0))))))))) is different from false [2023-11-25 00:07:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:05,108 INFO L93 Difference]: Finished difference Result 1440 states and 4744 transitions. [2023-11-25 00:07:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-25 00:07:05,109 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 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 28 [2023-11-25 00:07:05,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:05,123 INFO L225 Difference]: With dead ends: 1440 [2023-11-25 00:07:05,123 INFO L226 Difference]: Without dead ends: 1433 [2023-11-25 00:07:05,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=173, Invalid=693, Unknown=16, NotChecked=174, Total=1056 [2023-11-25 00:07:05,125 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 274 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 20 mSolverCounterUnsat, 81 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 81 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:05,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 62 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 934 Invalid, 81 Unknown, 712 Unchecked, 2.6s Time] [2023-11-25 00:07:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2023-11-25 00:07:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 740. [2023-11-25 00:07:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.288227334235453) internal successors, (2430), 739 states have internal predecessors, (2430), 0 states have call successors, (0), 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-11-25 00:07:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2430 transitions. [2023-11-25 00:07:05,168 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2430 transitions. Word has length 28 [2023-11-25 00:07:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:05,168 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 2430 transitions. [2023-11-25 00:07:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 26 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-11-25 00:07:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2430 transitions. [2023-11-25 00:07:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:07:05,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:05,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:05,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:07:05,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:05,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:07:05,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1039160544, now seen corresponding path program 2 times [2023-11-25 00:07:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316495466] [2023-11-25 00:07:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:06,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316495466] [2023-11-25 00:07:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316495466] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441315182] [2023-11-25 00:07:06,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:07:06,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:06,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:06,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:07:06,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-25 00:07:06,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:07:06,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-25 00:07:06,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:06,765 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-11-25 00:07:06,836 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-11-25 00:07:07,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:07:07,187 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 36 treesize of output 27 [2023-11-25 00:07:07,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:07:07,327 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 36 treesize of output 27 [2023-11-25 00:07:07,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-11-25 00:07:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:07,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:07:08,350 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~max3~0 1)) (.cse1 (+ c_~max2~0 1)) (.cse4 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~A~0.base) .cse3))) (or (= .cse0 c_~max1~0) (< .cse0 .cse1) (< .cse0 .cse2)))) (or .cse4 (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~A~0.base) .cse3))) (or (= .cse5 c_~max1~0) (< .cse5 .cse2)))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~A~0.base) .cse3))) (or (< c_~max2~0 .cse6) (< .cse6 .cse2)))))) (or (and (= c_~max1~0 c_~max3~0) (<= .cse1 c_~max3~0)) (and .cse4 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_138 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~A~0.base) .cse3)))))) is different from false [2023-11-25 00:07:10,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:10,900 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 123 treesize of output 87 [2023-11-25 00:07:10,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:10,924 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 3941 treesize of output 3753 [2023-11-25 00:07:10,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:10,975 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 207 treesize of output 195 [2023-11-25 00:07:10,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 142 [2023-11-25 00:07:11,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 139 [2023-11-25 00:07:11,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:11,338 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 79 treesize of output 55 [2023-11-25 00:07:11,344 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:11,345 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:11,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:11,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 76 treesize of output 64 [2023-11-25 00:07:11,382 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:11,383 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 34 treesize of output 28 [2023-11-25 00:07:11,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:11,422 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 55 treesize of output 43 [2023-11-25 00:07:11,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:11,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:07:11,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:11,443 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 51 treesize of output 43 [2023-11-25 00:07:11,462 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:07:11,462 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 27 treesize of output 23 [2023-11-25 00:07:11,499 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,499 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 79 treesize of output 1 [2023-11-25 00:07:11,513 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,515 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 101 treesize of output 1 [2023-11-25 00:07:11,529 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,529 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 1 [2023-11-25 00:07:11,544 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,544 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 113 treesize of output 1 [2023-11-25 00:07:11,558 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,558 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 132 treesize of output 1 [2023-11-25 00:07:11,573 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,574 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 89 treesize of output 1 [2023-11-25 00:07:11,587 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-25 00:07:11,588 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 89 treesize of output 1 [2023-11-25 00:07:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:11,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441315182] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:11,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930996804] [2023-11-25 00:07:11,712 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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-11-25 00:07:11,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:11,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-11-25 00:07:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551266791] [2023-11-25 00:07:11,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-25 00:07:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:11,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-25 00:07:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=528, Unknown=13, NotChecked=48, Total=702 [2023-11-25 00:07:11,715 INFO L87 Difference]: Start difference. First operand 740 states and 2430 transitions. Second operand has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 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-11-25 00:07:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:17,252 INFO L93 Difference]: Finished difference Result 1208 states and 3979 transitions. [2023-11-25 00:07:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:07:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-25 00:07:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:17,265 INFO L225 Difference]: With dead ends: 1208 [2023-11-25 00:07:17,265 INFO L226 Difference]: Without dead ends: 1201 [2023-11-25 00:07:17,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=184, Invalid=849, Unknown=27, NotChecked=62, Total=1122 [2023-11-25 00:07:17,267 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 283 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 19 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:17,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 65 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1320 Invalid, 52 Unknown, 169 Unchecked, 4.3s Time] [2023-11-25 00:07:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2023-11-25 00:07:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 721. [2023-11-25 00:07:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 3.2680555555555557) internal successors, (2353), 720 states have internal predecessors, (2353), 0 states have call successors, (0), 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-11-25 00:07:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 2353 transitions. [2023-11-25 00:07:17,304 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 2353 transitions. Word has length 28 [2023-11-25 00:07:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:17,304 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 2353 transitions. [2023-11-25 00:07:17,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 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-11-25 00:07:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 2353 transitions. [2023-11-25 00:07:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:07:17,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:17,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, 1, 1] [2023-11-25 00:07:17,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:07:17,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:17,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:07:17,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1059673566, now seen corresponding path program 3 times [2023-11-25 00:07:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716841660] [2023-11-25 00:07:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:18,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716841660] [2023-11-25 00:07:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716841660] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108700492] [2023-11-25 00:07:18,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:07:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:18,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:18,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:07:18,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:07:18,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:07:18,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-25 00:07:18,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:19,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-25 00:07:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:07:19,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:07:19,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:19,580 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 131 treesize of output 75 [2023-11-25 00:07:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:07:20,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108700492] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:20,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911351628] [2023-11-25 00:07:20,146 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-11-25 00:07:20,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:20,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 23 [2023-11-25 00:07:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790140276] [2023-11-25 00:07:20,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:07:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:20,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:07:20,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-11-25 00:07:20,150 INFO L87 Difference]: Start difference. First operand 721 states and 2353 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-25 00:07:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:22,427 INFO L93 Difference]: Finished difference Result 1486 states and 4911 transitions. [2023-11-25 00:07:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-25 00:07:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-25 00:07:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:22,442 INFO L225 Difference]: With dead ends: 1486 [2023-11-25 00:07:22,443 INFO L226 Difference]: Without dead ends: 1479 [2023-11-25 00:07:22,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1916, Unknown=0, NotChecked=0, Total=2352 [2023-11-25 00:07:22,445 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 260 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:22,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 42 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-25 00:07:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2023-11-25 00:07:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 767. [2023-11-25 00:07:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 3.2715404699738904) internal successors, (2506), 766 states have internal predecessors, (2506), 0 states have call successors, (0), 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-11-25 00:07:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2506 transitions. [2023-11-25 00:07:22,488 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2506 transitions. Word has length 28 [2023-11-25 00:07:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:22,489 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2506 transitions. [2023-11-25 00:07:22,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 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-11-25 00:07:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2506 transitions. [2023-11-25 00:07:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:07:22,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:22,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:22,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:07:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-25 00:07:22,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:07:22,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1157533970, now seen corresponding path program 4 times [2023-11-25 00:07:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:22,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970125381] [2023-11-25 00:07:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:23,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970125381] [2023-11-25 00:07:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970125381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251089514] [2023-11-25 00:07:23,746 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-25 00:07:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:23,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:23,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:07:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:23,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-25 00:07:23,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:24,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-25 00:07:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:24,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:07:24,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:24,687 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 123 treesize of output 75 [2023-11-25 00:07:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251089514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:25,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1009851807] [2023-11-25 00:07:25,258 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-11-25 00:07:25,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2023-11-25 00:07:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183174218] [2023-11-25 00:07:25,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:25,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-25 00:07:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-25 00:07:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-11-25 00:07:25,262 INFO L87 Difference]: Start difference. First operand 767 states and 2506 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:07:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:26,151 INFO L93 Difference]: Finished difference Result 1156 states and 3817 transitions. [2023-11-25 00:07:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:07:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-25 00:07:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:26,166 INFO L225 Difference]: With dead ends: 1156 [2023-11-25 00:07:26,166 INFO L226 Difference]: Without dead ends: 1149 [2023-11-25 00:07:26,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2023-11-25 00:07:26,168 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 144 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:26,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 45 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:07:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-11-25 00:07:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 811. [2023-11-25 00:07:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.274074074074074) internal successors, (2652), 810 states have internal predecessors, (2652), 0 states have call successors, (0), 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-11-25 00:07:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2652 transitions. [2023-11-25 00:07:26,206 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2652 transitions. Word has length 28 [2023-11-25 00:07:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:26,207 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2652 transitions. [2023-11-25 00:07:26,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:07:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2652 transitions. [2023-11-25 00:07:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:07:26,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:26,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:26,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:07:26,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-25 00:07:26,417 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:07:26,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash -335827294, now seen corresponding path program 5 times [2023-11-25 00:07:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471815296] [2023-11-25 00:07:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:27,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471815296] [2023-11-25 00:07:27,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471815296] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:27,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372605439] [2023-11-25 00:07:27,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:07:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:27,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:27,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:07:27,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-25 00:07:27,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:07:27,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-25 00:07:27,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2023-11-25 00:07:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:28,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:07:28,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:28,788 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 131 treesize of output 75 [2023-11-25 00:07:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372605439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384465758] [2023-11-25 00:07:29,439 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-11-25 00:07:29,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:29,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2023-11-25 00:07:29,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985034224] [2023-11-25 00:07:29,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:29,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:07:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:29,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:07:29,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-11-25 00:07:29,445 INFO L87 Difference]: Start difference. First operand 811 states and 2652 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-25 00:07:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:30,368 INFO L93 Difference]: Finished difference Result 1204 states and 3971 transitions. [2023-11-25 00:07:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:07:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-25 00:07:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:30,379 INFO L225 Difference]: With dead ends: 1204 [2023-11-25 00:07:30,380 INFO L226 Difference]: Without dead ends: 1197 [2023-11-25 00:07:30,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2023-11-25 00:07:30,381 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 122 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:30,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 39 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-25 00:07:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2023-11-25 00:07:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 839. [2023-11-25 00:07:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 3.2911694510739857) internal successors, (2758), 838 states have internal predecessors, (2758), 0 states have call successors, (0), 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-11-25 00:07:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2758 transitions. [2023-11-25 00:07:30,416 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 2758 transitions. Word has length 28 [2023-11-25 00:07:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:30,417 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 2758 transitions. [2023-11-25 00:07:30,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-25 00:07:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 2758 transitions. [2023-11-25 00:07:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:07:30,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:30,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:30,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:07:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:30,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-25 00:07:30,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1881380242, now seen corresponding path program 6 times [2023-11-25 00:07:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455670452] [2023-11-25 00:07:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:31,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455670452] [2023-11-25 00:07:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455670452] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047782412] [2023-11-25 00:07:31,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:07:31,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:31,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:31,574 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:31,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64e9d195-2e3b-4f5b-a540-3c665186c0f6/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:07:31,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:07:31,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:07:31,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-25 00:07:31,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:32,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2023-11-25 00:07:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:07:32,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:07:32,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:07:32,490 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 123 treesize of output 75 [2023-11-25 00:07:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:07:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047782412] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:07:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931715083] [2023-11-25 00:07:33,085 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-11-25 00:07:33,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:07:33,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2023-11-25 00:07:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142847488] [2023-11-25 00:07:33,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:07:33,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:07:33,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:07:33,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-11-25 00:07:33,089 INFO L87 Difference]: Start difference. First operand 839 states and 2758 transitions. Second operand has 24 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 23 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)